ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a positive integer, let Φn(x)\Phi_n(x) be the nnth cyclotomic polynomial, and write ϕ(n)\phi(n) for Euler's totient function. For each positive integer rr, let Jr(n)J_r(n) denote the Jordan totient function, and let Φn(m)(1)\Phi_n^{(m)}(1) denote the mmth derivative of Φn\Phi_n evaluated at 11. For a non-negative integer kk, consider the polynomial expression for Φn(2k+1)(1)/Φn(1)\Phi_n^{(2k+1)}(1)/\Phi_n(1) in the indicated variables.

Divisibility conjecture. For any non-negative integer kk, Φn(2k+1)(1)/Φn(1)\Phi_n^{(2k+1)}(1)/\Phi_n(1) is divisible by ϕ(n)−2k\phi(n)-2k in the polynomial ring

Q(ϕ(n),J2(n),J4(n),…,J2⌊(ℓ+1)/2⌋(n)).{\mathbb Q}\left(\phi(n), J_{2}(n), J_4(n),\dots, J_{2\lfloor (\ell+1)/2\rfloor}(n)\right).

This conjecture is suggested by explicit formulas for the first few derivatives and by an observation attributed to Lehmer concerning the coefficients in the expansion of Φn(x+1)\Phi_n(x+1). The source does not provide a resolution, so the conjecture remains open.

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.