ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (an)(a_n) be the divisibility sequence with factorization an=∏d∣nbda_n=\prod_{d\mid n}b_d, and let ρ(p)\rho(p) denote the least positive index such that p∣aρ(p)p\mid a_{\rho(p)}. For indices m,nm,n, write (bm,bn)(b_m,b_n) for their greatest common divisor.

Gcd conjecture. If (bm,bn)>1(b_m,b_n)>1, then

mn=pα\frac{m}{n}=p^\alpha

\nfor some prime pp and some exponent α\alpha.

This conjecture describes when two distinct factors in the divisor factorization of a divisibility sequence can share a prime divisor. The supplied text does not state whether it has been proved or disproved.

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.