The prime-index irreducibility conjecture for Stern polynomials
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.