The irreducibility conjecture for Stern polynomials with prescribed prime divisors

Let Bn(t)B_n(t) denote the Stern polynomial indexed by the positive integer nn. For a positive integer nn, say that it has exactly kk prime divisors, with the source's convention for counting prime divisors. The prescribed-divisor irreducibility conjecture. For each kN+k\in\mathbb{N}_{+} there exists an integer nn with exactly kk prime divisors such that

Bn(t) is irreducible.B_n(t)\text{ is irreducible}.

This extends the prime-index irreducibility question to indices with any prescribed number of prime divisors. The supplied text gives no 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

No solutions have been posted yet.