ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Dˉ(t)\bar D(t) count good pairs (m,n)(m,n) with m,nm,n both prime and m≤tm\leq t, n≤tn\leq t, where goodness means that Φm(Φn(x))\Phi_m(\Phi_n(x)) factors over the integers. Let π(t)\pi(t) denote the number of primes at most tt. Prime-index cyclotomic composition density conjecture.

lim⁡t→∞Dˉ(t)π(t)2=0.\lim_{t\to\infty}\frac{\bar D(t)}{\pi(t)^2}=0.

This is the prime-index analogue of the preceding density conjectures, restricting attention to cyclotomic polynomials indexed by primes.

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.