Abstract
For an integer n ≥ 2 we denote by P(n) the largest prime factor of n. We obtain several upper bounds on the number of solutions of congruences of the form n! + 2n − 1 ≡ 0 (mod q) and use these bounds to show that (formula presented).
Original language | English |
---|---|
Pages (from-to) | 859-870 |
Number of pages | 12 |
Journal | Journal de Theorie des Nombres de Bordeaux |
Volume | 17 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2005 |