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 continued fraction of has symmetric period ending in
Statement
Let be a positive integer that is not a square, let and let be its regular continued fraction. Then there is an integer such that with For the state variables of The complete quotients of satisfy the recurrence, the first returned reduced state is
Facts & Assumptions
Given: A positive nonsquare integer , the continued-fraction digits of , and the state variables .
The complete quotients satisfy with , , each , and each (The complete quotients of satisfy the recurrence).
Proof
For every , [F1] and the floor inequality give Also for , so Since for , the recurrence in [F1] gives and therefore Hence So for the pair lies in the finite set of integer pairs with and .
Let be the finite set of integer pairs satisfying Step 1.1 shows that every with lies in , and [F1] defines a successor map . This map is bijective: given , put The interval has irrational endpoints and length , so it contains exactly one integer in the residue class . Then so . Since the orbit of stays in the finite set , there is a least with , that is, .
The recurrence at gives Apply the inverse construction of step 2.1 to . Then and the interval contains the unique integer . So the unique predecessor of in is . Since is the predecessor of along the cycle from step 2.1, one has The recurrence formula now gives
We prove by induction on that The case is step 3.1 together with . Assume it for some . Then [F1] gives Also and are both integers congruent to modulo , and both lie in the interval by step 1.1; by the uniqueness from step 2.1 they are equal. Thus completing the induction. Therefore, for ,
Steps 2.1, 3.1, and 4.1 show that the continued-fraction digits from onward repeat with period , that the last digit in one period is , and that the interior digits are palindromic. Hence with first returned reduced state .
Depends on
Used by
Dependency tree · two levels
2 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
- Peter Hackman, Elementary Number Theory (standard reference, not scraped)
- MIT 18.781, Lecture 21: Brahmagupta-Pell Equation (standard reference, not scraped)