Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-28
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Negative Pell is soluble exactly for odd period length

Statement

Let be the period length of the regular continued fraction of D. Then the negative Pell equation x2Dy2=1 has an integral solution if and only if is odd.

When is odd, the convergent p1/q1 gives the least positive solution of x2Dy2=1, and the least positive solution of x2Dy2=1 is the convergent p21/q21. When is even, the least positive norm-one solution is p1/q1.

Facts & Assumptions

Given: A positive nonsquare integer D, the period length of D, and the convergents pn/qn of D.

[F1]

The continued fraction of D has period [a0;a1,,a1,2a0], and the first returned reduced state satisfies P=a0,Q=1. (The continued fraction of D has symmetric period ending in 2a0)

[F2]

For each complete quotient, one has an=αn, and if αnan then αn+1=1αnan. (Complete quotients in the continued-fraction algorithm)

[F3]

The complete quotients satisfy αn=D+PnQn,Qn>0. (The complete quotients of D satisfy the Pn,Qn recurrence)

[F4]

The convergents satisfy pn2Dqn2=(1)n+1Qn+1. (Convergents to D satisfy the norm identity).

[F5]

If a reduced rational number r/s satisfies Drs<12s2, then r/s is a convergent of D (Legendre's criterion for convergents).

Proof

technique · direct
1.1

Applying [F4] at n=1 and using Q=1 from [F1] gives p12Dq12=(1). Hence odd yields a negative-Pell solution at p1/q1, while even yields a positive norm-one solution there.

F1F4algebra
1.2

Conversely, suppose x,y>0 satisfy x2Dy2=1. Then 0<Dxy=1y(x+yD). Because D2, one has x2=Dy21y2, so xy, and therefore x+yD>2y. Hence Dxy<12y2. Since gcd(x,y)=1 follows from x2Dy2=1, fact [F5] shows that x/y=pn/qn for some convergent.

F5givenalgebra
1.3

By [F1] and [F3], the returned state at one full period is α=D+PQ=D+a0. Since α=2a0, fact [F2] gives α+1=1αα=1Da0=α1. Thus one full period returns the complete-quotient algorithm to α1; because the digits from a1 onward repeat with period , the same computation one period later gives α2=D+a0, hence Q2=1. Applying [F4] at n=21 yields p212Dq212=(1)2Q2=1. Thus p21/q21 is a positive norm-one solution.

F1F2F3F4algebra
2.1

For that index n, [F4] gives 1=x2Dy2=pn2Dqn2=(1)n+1Qn+1. Since Qn+1 is a positive integer, it follows that Qn+1=1andn is even. Facts [F2] and [F3] then give αn+1=D+Pn+1,αn+2=1αn+1αn+1=1Da0=α1. So the digit block from a1 onward repeats with period n+1. Because is the period length, divides n+1. Since n+1 is odd, must be odd.

F2F3F4step 1.2algebra
3.1

Step 2.1 shows that every positive negative-Pell solution comes from a convergent index n with n even and (n+1), so the first such index is 1. Now let u,v>0 satisfy u2Dv2=1. Then 0<uvD=1v(u+vD). Because D2, one has u2=Dv2+1>v2, so u>v, and therefore u+vD>2v. Hence Duv<12v2. Since gcd(u,v)=1, [F5] shows that u/v=pn/qn for some convergent. Applying [F4] gives 1=u2Dv2=pn2Dqn2=(1)n+1Qn+1, so Qn+1=1andn is odd. As in step 2.1, facts [F2] and [F3] then give αn+2=α1, so divides n+1. Therefore the first possible norm-one index is 1 when is even and 21 when is odd. Convergent denominators strictly increase, and for positive solutions of x2Dy2=±1 the value of x is determined by x2=Dy2±1, so the first convergent of each type gives the least positive solution. Therefore, when is odd, p1/q1 is the least positive negative-Pell solution and p21/q21 is the least positive norm-one solution, while when is even, p1/q1 is the least positive norm-one solution.

F2F3F4F5step 1.3step 2.1algebra

Depends on

Used by

Dependency tree · two levels

17 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources