Timeline for Find Integral Roots of A Polynomial
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 6, 2019 at 22:29 | comment | added | Roman | 24 bytes with a Default pattern and an operator right-composition | |
| Jan 29, 2018 at 15:48 | comment | added | Kelly Lowder | @alephalpha, fixed. | |
| Jan 29, 2018 at 15:48 | history | edited | Kelly Lowder | CC BY-SA 3.0 |
address corner case and bug
|
| Jan 27, 2018 at 4:15 | comment | added | alephalpha | It fails when 0 is a root. | |
| Jan 25, 2018 at 23:08 | history | edited | Kelly Lowder | CC BY-SA 3.0 |
correction
|
| Jan 25, 2018 at 23:01 | history | edited | Kelly Lowder | CC BY-SA 3.0 |
explanation
|
| Jan 25, 2018 at 22:49 | history | edited | Kelly Lowder | CC BY-SA 3.0 |
added another TIO
|
| Jan 25, 2018 at 22:40 | history | edited | Kelly Lowder | CC BY-SA 3.0 |
grammar
|
| Jan 25, 2018 at 5:45 | history | edited | Kelly Lowder | CC BY-SA 3.0 |
new suggestion
|
| Jan 25, 2018 at 2:48 | comment | added | IridescenceDeep | OP said in a comment that you could use your language's native polynomial type if one exists. I don't know Mathematica well but I imagine there is one... Would that save bytes? | |
| Jan 25, 2018 at 0:32 | comment | added | Not a tree |
I think you can use #.# instead of Tr@Abs@#: it's a worse bound but fewer bytes.
|
|
| Jan 24, 2018 at 19:39 | history | edited | Kelly Lowder | CC BY-SA 3.0 |
Update for extra golfing
|
| Jan 24, 2018 at 19:15 | history | answered | Kelly Lowder | CC BY-SA 3.0 |