{"id":"palomar/PALOMAR-2026-11-21-000012","url":"https://github.com/jkfarland-bot/M2Polymath/tree/47f63036342b3cfc956a7f92d1d47c160cf3f8d4","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-21-000012-v2.json","repo":"https://github.com/jkfarland-bot/M2Polymath","tags":["math.NT","msc:11A25","msc:11N05","msc:11Y16","msc:68V20"],"score":0,"title":"M2Polymath: the exact degree of divisor-sum identities for the prime-counting function modulo prime powers","trust":"high","domain":"math.NT","source":"palomar","authors":["Joseph S. Farland"],"reviews":0,"subject":"math.NT","summary":"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 <=…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-22","reactions":{},"formalized":true,"formalizes":[{"title":"The exact degree of divisor-sum identities for the prime-counting function modulo prime powers","identifier":"https://doi.org/10.5281/zenodo.24423389","relationship":"formalizes"}]}