ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers n>2n>2 and k>1k>1, let Fn,k(x)=Φn(1+x+⋯+xk)∈Q[x]F_{n,k}(x)=\Phi_n(1+x+\cdots+x^k)\in\mathbb{Q}[x], where Φn\Phi_n is the nn-th cyclotomic polynomial. Determine, exactly in terms of nn and kk, whether Fn,k(x)F_{n,k}(x) is reducible over Q\mathbb{Q} and, in the reducible cases, determine the number of irreducible factors.

Record

Added
Links

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.