M2Polymath: the exact degree of divisor-sum identities for the prime-counting function modulo prime powers
Source: github.com/jkfarland-bot/M2Polymath/tree/47f63036342b3cfc95…
Consider integer combinations f = sum_z c_z (G_z * h_z) of Dirichlet convolutions in which each core G_z is the Dirichlet power zeta^z (z >= 0) or mu^|z| (z = 1, the least Z for which some combination with degrees in {-Z..Z} meets D_k is S(p^ceil(k/2)), and with degrees in {1..Z} (no inverse factors) it is S(p^k), where S(m) is the least s with m dividing s! (the Kempner function). As corollaries no combination detects primes modulo p, and the divided target needs a degree divisible by p. It also proves D_3(x) = floor(x^(1/3)) + 3H(x), where H(x) counts triples (a, b, c) with abc <= x, a <=…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-21-000012
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-21-000012/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-000012/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'