ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (Fn)n≥0(F_n)_{n\ge 0} be the Fibonacci sequence, defined by F0=0F_0 = 0, F1=1F_1 = 1, and Fn+1=Fn+Fn−1F_{n+1} = F_n + F_{n-1} for n≥1n \ge 1. For an integer m≥1m \ge 1, the sequence (Fn mod m)n≥0(F_n \bmod m)_{n \ge 0} is periodic; let π(m)\pi(m) denote its minimal period, so that π(m)\pi(m) is the least positive integer kk with Fk≡0(modm)F_{k} \equiv 0 \pmod m and Fk+1≡1(modm)F_{k+1} \equiv 1 \pmod m.

Call a prime pp a Wall\u2013Sun\u2013Sun prime if

p2∣Fπ(p),p^2 \mid F_{\pi(p)},

equivalently if π(p2)=π(p)\pi(p^2) = \pi(p); for p≠2,5p \neq 2,5 this holds if and only if

p2∣F p−(p5),(p5)={1if p≡±1(mod5),−1if p≡±2(mod5),p^2 \mid F_{\,p - \left(\frac{p}{5}\right)}, \qquad \left(\frac{p}{5}\right) = \begin{cases} 1 & \text{if } p \equiv \pm 1 \pmod 5,\\ -1 & \text{if } p \equiv \pm 2 \pmod 5,\end{cases}

and also if and only if Lp≡1(modp2)L_p \equiv 1 \pmod{p^2}, where (Ln)n≥0(L_n)_{n \ge 0} is the Lucas sequence L0=2L_0 = 2, L1=1L_1 = 1, Ln+1=Ln+Ln−1L_{n+1} = L_n + L_{n-1}.

There exist infinitely many Wall\u2013Sun\u2013Sun primes.

Record

Added
Links

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.