ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T(n)T(n) be the set of Toda primes of nn, where a Toda prime is an odd prime pp satisfying

p−1∣4n,gcd⁡(p,4np−1)=1.p-1\mid 4n,\qquad \gcd\left(p,\frac{4n}{p-1}\right)=1.

Write t(n)=∣T(n)∣t(n)=|T(n)|. Toda-prime lower-bound conjecture. Let nn be an odd, square-free multiple of 33. Assume that there exists p∈{5,7,13}p\in\{5,7,13\} such that p∣np\mid n, and that r∤nr\nmid n for r∈{5,7,13}−{p}r\in\{5,7,13\}-\{p\}. Finally, assume there exists q∈T(3p)−{5,7,13}q\in T(3p)-\{5,7,13\} such that q∤nq\nmid n. Then

t(n)≥4.t(n)\geq 4.

This conjecture is the stated snag in the authors' attempted proof of the one-Toda-prime question. It supplies a conditional theorem-like lower bound for a structured family of integers, while the general existence question 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.