A curious congruence modulo prime powers (Q404320): Difference between revisions

Let \(B_n\) denote the \(n\)th Bernoulli number. The authors show that for any prime \(p\geq 3\) and positive integer \(r\) one has \[ \sum_{i+j+k=p^r}{1\over ijk}\equiv -2p^{r-1}B_{p-3}\pmod{p^r}, \] where \(i,j\) and \(k\) are positive integers that are coprime to \(p\). The case \(r=1\) was established earlier by \textit{J. Zhao} [J. Number Theory 123, No. 1, 18--26 (2007; Zbl 1115.11005)].