Timeline for Is a polynomial with 1 very large coefficient irreducible?
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 8, 2009 at 19:33 | comment | added | Greg Kuperberg | How about if the polynomial is monic and has constant term 1, and the total norm of all of the small coefficients is bounded by a constant. | |
| Dec 8, 2009 at 15:33 | comment | added | Gjergji Zaimi | Well, I was trying (1,1,..,k) for large enough k, restricting the height makes the search...harder. The cyclotomic polynomials are unfortunately the only family of arbitrarily large degree I know. Then there are values like (1,1,1,0,...,0,0) which for all n have a very small fraction of reducible polynomials. | |
| Dec 8, 2009 at 15:02 | history | answered | user2282 | CC BY-SA 2.5 |