Skip to main content
added 6 characters in body
Source Link

There exists a polynomial $f(x)$ with integer coefficients, with $f(x)>x$ for all non negative integers $x$, such that all iterations of $f$ starting at zerosome non negative integer are prime numbers. Certainly published before 2006 and also outrageous.

There exists a polynomial $f(x)$ with integer coefficients, with $f(x)>x$ for all non negative integers $x$, such that all iterations of $f$ starting at zero are prime numbers. Certainly published before 2006 and also outrageous.

There exists a polynomial $f(x)$ with integer coefficients, with $f(x)>x$ for all non negative integers $x$, such that all iterations of $f$ starting at some non negative integer are prime numbers. Certainly published before 2006 and also outrageous.

added 20 characters in body
Source Link

There existexists a polynomial $f(x)$ with integer coefficientcoefficients, with $f(x)>x$ for all non negative integers $x$, such that all iterations of $f$ starting at zero are prime numbers. Certainly published before 2006 and also outrageous.

There exist a polynomial $f(x)$ with integer coefficient, with $f(x)>x$ for all non negative integers $x$, such that all iterations of $f$ starting at zero are prime numbers. Certainly published before 2006.

There exists a polynomial $f(x)$ with integer coefficients, with $f(x)>x$ for all non negative integers $x$, such that all iterations of $f$ starting at zero are prime numbers. Certainly published before 2006 and also outrageous.

Source Link

There exist a polynomial $f(x)$ with integer coefficient, with $f(x)>x$ for all non negative integers $x$, such that all iterations of $f$ starting at zero are prime numbers. Certainly published before 2006.

Post Made Community Wiki by Euro Vidal Sampaio