ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be an odd square-free integer with kk distinct prime factors, and let NnN_n denote the number of real roots of Φn′\Phi_n^{\prime}. For primes pp not dividing nn, write NnpN_{np} similarly. Counting conjecture.

2k−1≤Nn≤2k−1.2k-1\leq N_n\leq 2^k-1.

Moreover, Nn=2k−1N_n=2k-1 if nn is the product of the kk smallest odd primes, and if p<p′p<p' are primes not dividing nn, then Nnp≤Nnp′N_{np}\leq N_{np'}. These bounds and monotonicity are suggested by computations and by the proof of the main result, but are presented as open challenges.

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.