ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be a prime number, and let nn be a pp-index ratio number, with divisors d1<d2<⋯<dτ(n)d_1<d_2<\cdots<d_{\tau(n)}. Prime index-ratio divisor-pair conjecture. Then

d2j=pd2j−1for all 1≤j≤τ(n)/2.d_{2j}=p d_{2j-1}\quad\text{for all }1\leq j\leq \tau(n)/2.

Theorem 9 proves this when τ(n)≤8\tau(n)\leq 8, and the source notes that infinitely many examples with larger divisor count satisfy the equalities. The general statement is supported by numerical calculations and 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.