Theorem. Let be a positive integer for which
has a solution. If , the lexicographically first solution uniquely maximizes . This proves David Batista's conjecture that every term of A398581 is modulo . Batista records the case and gives a table through . OEIS A398581
Proof using the best two-term underapproximation theorem
For , write in lowest terms. Set
These are the first two strict greedy steps. The error after taking is , and the error after taking is .
| 0 | 1 | 1 | |
| 2 | 5 | 3 | |
| 3 | 5 | 2 | |
| 4 | 5 | 1 |
The error is always a unit fraction in these four cases. For we have . For we have or . For the identity gives , so or . Thus or . In every case is integral.
The denominators are strictly increasing. The first greedy remainder is at most , which gives since . The second remainder is at most , so . The triple is lexicographically first because any admissible first denominator is at least and, with that choice, any admissible second denominator is at least .
Hùng Việt Chu's Theorem 1.3 says that the strict greedy pair gives the unique largest two-unit-fraction sum strictly below whenever the least positive with is at most three, apart from a possible tie at . Our is exactly that integer. The table covers every required residue, and is impossible for integral . Every competing triple has remaining fraction . Its first two terms sum to at most , with strict inequality for a different ordered pair. Hence , with equality only for the same triple. Chu, Theorem 1.3
For , even is too small. For the optimal triples are respectively , and . The first denominator is forced in each case. For , starting at two gives at most . Once the first denominator is fixed, decreases strictly as increases. This completes the proof.
Independent elementary comparison
The following argument replaces Chu's theorem for . The finite cases below 100 can be enumerated with the accompanying verifier. Retain the preceding notation for the greedy triple and put . Since , we have .
For a competing first denominator , write and . If the second denominator is and the third is , then and
Also . The function is convex for . Indeed, on substituting , it is a linear function of plus a positive constant times .
Here . For it suffices by convexity to bound the two endpoints. At the first,
since and the table gives . At the other endpoint , the numerator is at most and the denominator is . The last inequality follows from when , and from , when .
For and , the same estimate works with numerator at most and . If , then , , and . Thus , giving
Here . This excludes every larger first denominator. At the third denominator decreases strictly as the second increases.
The finite enumeration ranges over and with . It calculates and checks divisibility and . These bounds follow directly from , so the enumeration covers every solution. The verifier also compares against Batista's full published table through 1500. Batista's table
Prior work and scope
Chu proved the general best-two-term theorem in 2023–2024. The additional step here proves that his optimizing pair actually extends to an exact, strictly ordered three-term representation in all four required classes. A November 18, 2026 search by sequence number, author, and equivalent Egyptian-fraction formulations located no earlier proof specifically stating Batista's congruence. Historical priority remains unverified. The example in Batista's entry illustrates the behavior in the remaining class. Batista · Chu
Lean verification
The full theorem is formalized as Egyptian.batista_admissible_congruence in EgyptianTheorem.lean. It follows the independent elementary comparison and proves completeness of its kernel-checked finite enumeration. It has no pair-optimality or published theorem premise. See verification status and reproduction.