Timeline for Find Integral Roots of A Polynomial
Current License: CC BY-SA 3.0
9 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
Jan 24, 2018 at 22:59 | comment | added | Luis Mendo | ... but I found a shorter alternative for the range | |
Jan 24, 2018 at 22:58 | history | edited | Luis Mendo | CC BY-SA 3.0 |
deleted 2 characters in body
|
Jan 24, 2018 at 22:44 | comment | added | Luis Mendo |
@Giuseppe Thanks to both. Maybe X>t_w&:GyZQ~) , but still 13 bytes
|
|
Jan 24, 2018 at 22:37 | comment | added | Giuseppe | @mathmandan that approach is three bytes longer: Try it here, although I'm sure I've missed a trick or two | |
Jan 24, 2018 at 21:14 | comment | added | mathmandan | As an alternative to Rouche's Theorem, the Rational Roots Theorem would also suffice to justify the bound you used. By the Rational Roots Theorem, all integer roots are bounded in absolute value by the maximum of the absolute values of the coefficients, a tighter bound than the sum. Or even tighter, by the absolute value of the "last" nonzero coefficient--i.e. the coefficient of the smallest power of x which has a nonzero coefficient. (Probably doesn't help save any bytes, just an alternative proof since the RRT is probably more familiar than Rouche to most folks.) :) | |
Jan 24, 2018 at 16:14 | history | edited | Mr. Xcoder | CC BY-SA 3.0 |
edited body
|
Jan 24, 2018 at 15:30 | history | edited | Luis Mendo | CC BY-SA 3.0 |
added 902 characters in body
|
Jan 24, 2018 at 15:23 | history | answered | Luis Mendo | CC BY-SA 3.0 |