ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD be a fixed positive nonsquare integer, let pp be a fixed prime with gcd⁡(D,p)=1\gcd(D,p)=1, and let N(−D,2)N(-D,2) denote the number of solutions (x,n)(x,n) in N2\mathbb{N}^2 of

x2−D=2n+2.x^2-D=2^{n+2}.

The exceptional conditions (i)(i), (ii)(ii), and (iii)(iii) are the three conditions on DD listed above in the source. Beukers' conjecture.

N(−D,2)≤2,N(-D,2)\leq 2,

except when DD satisfies one of the conditions (i)(i), (ii)(ii), or (iii)(iii). This conjecture concerns the sharpened bound for the number of solutions after the known result N(−D,2)≤3N(-D,2)\leq 3, apart from condition (i)(i); its status is not specified in the source.

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.