Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck 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.

The large fundamental solution for D=61

Example

A direct continued-fraction calculation gives 61=[7;1,4,3,1,2,2,1,3,4,1,14‾], so the period length is 11. The least positive solution of x2−61y2=−1 is 29718+380561, and the least positive solution of x2−61y2=1 is its square 1766319049+22615398061.

Facts & Assumptions

Given: The positive nonsquare integer D=61.

[F1]

Negative Pell is soluble exactly for odd period length, and when the period length is odd the least positive negative-Pell solution is pℓ−1/qℓ−1 while the least positive norm-one solution is p2ℓ−1/q2ℓ−1 (Negative Pell is soluble exactly for odd period length).

Verification

technique · direct
1.1F1givenalgebra

The displayed continued fraction has odd period length ℓ=11. Running the convergent recurrence through one full period gives p10/q10=29718/3805. Fact [F1] therefore gives 297182−61⋅38052=−1, so 29718+380561 is the least positive negative-Pell solution.

2.1F1step 1.1algebra∎

Squaring that element gives (29718+380561)2=1766319049+22615398061, and therefore 17663190492−61⋅2261539802=1. By [F1], this is the least positive solution of Pell's equation for D=61. The example shows that a finite continued-fraction algorithm can still produce a very large fundamental solution.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 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