scientific article; zbMATH DE number 1161307
Recall Wilson's theorem, which states that \((p-1) \equiv -1 \bmod p,\) where \(p\) is prime. The authors use elementary methods to extend Wilson's theorem by proving that \[ mm[(p-1)+1]+p[m-1] \equiv 0 \bmod p(p+m), \] where \(p\) and \(p+m\) are odd primes, and that \[ m(p-m-1)+(-1)^m \equiv 0 \bmod p, \] where \(p\) is an odd prime and \(m \geq 0.\) Both of these statements follow from the fact that \(m (p-1) +1 \equiv 0 \bmod (p+m),\) where \(p\) and \(p+m\) are odd primes. The authors then search for solutions to the congruence \( m (p-m-1) +(-1)^m + rp \equiv 0 \bmod p^k\) , where \(p\) is prime and \(k \geq 2.\)
- Generalizzazione del teorema di Wilson alle terne prime
- A generalization of Wilson's theorem
- q-ANALOGUES OF WILSON'S THEOREM
- scientific article; zbMATH DE number 2189797 (Why is no real title available?)
- scientific article; zbMATH DE number 3399322 (Why is no real title available?)
- On theorems of Fermat, Wilson, and Gegenbauer
- Some binomial coefficient congruences
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4393301)
