Batista's Egyptian fractions

What Lean checks

An ordered lexicographically first solution uniquely maximizes the last denominator for every admissible positive k outside residue class 1. The proof uses the elementary global comparison and a kernel-reduced exhaustive certificate below 100, with proved denominator bounds; no published comparison theorem is a hypothesis.

Collection · Catalogue · Verification · Lean status

Result

OEIS A398581: the lexicographically first triple uniquely maximizes the last denominator for admissible k ≢ 1 (mod 5).

Proof and sources

Read the proof for the original problem, assumptions, argument, and cited sources. These notes are unrefereed.

Verification

Run from the repository root:

python3 results/batista-egyptian-fractions/verify.py

See the verification guide for dependencies and the distinction between computational checks and formal proofs.

Formalization

The stated result is marked formally verified. See the status report for checked scope and remaining dependencies.