ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (un)n≥0(u_n)_{n\ge 0} be the Lucas sequence associated to integers aa and bb with ∣a∣≥3|a|\ge 3 and b=−1b=-1, so that u0=0u_0=0, u1=1u_1=1, and

un+1=aun+bun−1.u_{n+1}=a u_n+b u_{n-1}.

Pairwise coprimality conjecture. For any two different primes pp and qq, the terms upu_p and uqu_q are relatively prime:

gcd⁡(up,uq)=1.\operatorname{gcd}(u_p,u_q)=1.

The preceding theorem proves that ∣un∣|u_n| is composite for every n≥3n\ge 3, while this conjecture asserts that prime-indexed terms nevertheless do not share any common prime divisor. If true, it would imply that no finite set of primes divides every term of the sequence.

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.