Some congruences modulo primes

The author proves the following result which can be viewed as a generalization of a congruence first found by \textit{Zhi-Wei Sun} [Proc. Am. Math. Soc. 123, 1341-1346 (1995; Zbl 0833.11001)]: Let \(p\) be an odd prime and \(n \in {\mathbb{N}}\), \(n \geq 2\). Then \[ \frac{1}{2^{n-2}} \sum_{1 \leq \nu < p/2^n} \frac{(-1)^{\nu}}{\nu} \equiv \sum_{1 \leq \nu < p} \frac{(-1)^{\nu}}{\nu} +\sum_{1 \leq \nu < p/2} c_{\nu, n} \frac{1}{\nu \cdot 2^{\nu}} \pmod p, \] where \[ c_{\nu, n}:= \sum_{a,b,c \geq 0, a+b+c= \nu, b \equiv c \pmod{2^{n-1}}} (-1)^{\frac{b-c}{2^{n-1}}} \frac{\nu !}{a! b! c!} \frac{1}{2^{b+c}}. \]

Recommendations

Cited in

(15)

This page was built for publication: Some congruences modulo primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295739)