The prime-index irreducibility conjecture for Stern polynomials
The prime-index irreducibility conjecture for Stern polynomials
Let be the Stern polynomial indexed by a prime number . The prime-index irreducibility conjecture. For every prime number , the polynomial is irreducible.
The conjecture was checked computationally for the first million primes, but the supplied text gives no general proof or resolution.
Sources & referencesView supporting material
Primary source
Maciej Ulas and Oliwia Ulas, “On certain arithmetic properties of Stern polynomials”, arXiv:1102.5109 (2011).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.