ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be a prime with p≡3(mod4)p\equiv3\pmod 4, let e≥1e\ge1, and let (u(n))n≥0(u(n))_{n\ge0} be the sequence defined in the paper. The first conjecture.

(1) If e≥1e\ge1, then

u(n)≡0(modp2e−1)u(n)\equiv0\pmod{p^{2e-1}}

for n≥⌈ep2−12⌉n\ge\left\lceil\frac{ep^2-1}{2}\right\rceil.

(2) If e≥2e\ge2, then

u(n)≡0(modp2e)u(n)\equiv0\pmod{p^{2e}}

for n≥ep2+(e−2)p2n\ge\frac{ep^2+(e-2)p}{2}.

(2a) In particular,

u(n)≡0(modp2)u(n)\equiv0\pmod{p^2}

for n≥p2−12n\ge\frac{p^2-1}{2}.

These bounds are conjectured to improve the corresponding theorem by a factor of two; computer experiments indicate two sporadic cases with stronger bounds, but those observations are not part of the conjecture.

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.