ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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 k∈N+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.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.