OEIS A357513: u_m(p-1) ≡ 0 (mod p^4) for all primes p ≥ 2m + 6
Source: github.com/felixpernegger/oeis-a357513-supercongruence/tree…
For m ≥ 0 let u_m(n) be the numerator of the sum over k = 1, ..., n of binomial(n,k)^2 binomial(n+k,k)^2 / k^(2m+1). Peter Bala conjectured in OEIS A357513 (2022) that u_m(p-1) ≡ 0 (mod p^4) for all primes p, with finitely many exceptions that depend on m. This project gives a Lean 4 / Mathlib proof of that statement: for every m and every prime p ≥ 2m + 6, p^4 divides u_m(p-1). The proof writes T_k = binomial(p-1,k) binomial(p-1+k,k) as T_k^2 ≡ p^2/k^2 - 2p^3/k^3 (mod p^4), reduces the sum to the harmonic-type sums H(s) = sum of k^(-s) over 1 ≤ k ≤ p-1, shows H(2m+4) ≡ 0 (mod p) with the…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-21-000016
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-21-000016/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-21-000016/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'