Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24
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.

Extended Euclid gives 73=32+82 from the root 27 of −1

Example

Starting from 272≡−1(mod73), the Euclidean algorithm yields 73=32+82 without searching the full collision square.

Facts & Assumptions

Given: The congruence 272≡−1(mod73).

[F1]

A representation of a nonnegative integer n as a sum of two squares is an ordered pair (x,y)∈Z2 such that n=x2+y2 (Representations and primitive representations as sums of two squares).

Verification

technique · direct
1.1algebra

The Euclidean divisions 73=2⋅27+19 and 27=19+8 give 8=27−19=3⋅27−73.

2.1step 1.1algebra

Hence 8≡3⋅27(mod73), and the given square-root congruence gives 82≡9⋅272≡−9(mod73); therefore 73∣32+82.

3.1step 2.1F1algebra∎

Direct evaluation gives 32+82=9+64=73, so (3,8) is a two-square representation of 73 by [F1].

Depends on

Used by

Nothing in the library uses this result yet.

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