Timeline for Generating primes via composition of polynomials
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:19 | history | edited | CommunityBot |
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
|
|
| Dec 24, 2013 at 16:39 | history | edited | Joe Silverman |
added arithmetic-dynamics tag
|
|
| Dec 24, 2013 at 16:38 | answer | added | Joe Silverman | timeline score: 4 | |
| Dec 24, 2013 at 11:00 | answer | added | joro | timeline score: 3 | |
| Dec 24, 2013 at 2:53 | comment | added | Sidney Raffer | @Terry Tao: Thanks for pointing out this connection. I wonder if there are any footholds in the study of orbits of polynomials mod $p$ as $p$ varies? | |
| Dec 23, 2013 at 18:27 | comment | added | The Masked Avenger | On the other hand, with results of Zhang and improvements, it is possible that there is a (likely nonperiodic) sequence of polynomials p_i such that p_1(a), p_2(p_1(a)), ... are all prime, with p_i coming from {g(x), x+c} for c a small even number. (Posted before seeing Terry Tao's comment.) | |
| Dec 23, 2013 at 18:20 | comment | added | Terry Tao | Note that the Fermat numbers $2^{2^n}+1$ are of this form (with $f(a) = (a-1)^2 + 1$), and it is still not proven (though almost certainly true) that there are infinitely many composite Fermat numbers. So this problem is likely beyond the reach of current technology. | |
| Dec 23, 2013 at 17:20 | history | asked | Sidney Raffer | CC BY-SA 3.0 |