Lean proofs of Dimitrov's Conjectures 1 and 3
A Lean 4 formalization proving Dimitrov's Conjectures 1 and 3 for every natural k >= 1 and n >= 2. The results concern inequalities involving Euler's totient, Dedekind's psi function, and the sum-of-divisors function. The source paper proves the k = 1 instances and discusses k = 2, 3; this development covers the full stated range, including k >= 4, and additionally proves for each inequality that equality holds exactly when n is prime. By supplying the full parameter range and sharp equality cases beyond those treated in the source, the project is relevant to researchers in elementary and…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-09-13-000003
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-13-000003/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-09-13-000003/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'