Article 106078International audienceWe present improved algorithms for computing the left factorial residues $!p=0!+1!+\dots+(p-1)! \!\mod p$. We use these algorithms for the calculation of the residues $!p\!\mod p$, for all primes $p$ up to $2^{40}$. Our results confirm that Kurepa's left factorial conjecture is still an open problem, as they show that there are no odd primes $p<2^{40}$ such that $p$ divides $!p$. Additionally, we confirm that there are no socialist primes $p$ with $5<p<2^{40}$
Computations of irregular primes and associated cyclotomic invariants were extended to all primes up...
AbstractLet a1, …, as be distinct non-zero residue classes modulo a prime p. In this paper we estima...
For a prime p = 1 (mod 3), the reduced residue system S3, modulo p, has a proper multiplicative subg...
Article 106078International audienceWe present improved algorithms for computing the left factorial ...
The left factorial of n is defined to be 0! + 1! + ··· + (n − 1)! and is denoted by !n. Kurepa conje...
Using A. Weil’s estimates the authors have given bounds for the largest prime P0 such that all prime...
We prove under a mild condition that Kurepa's conjecture holds for the set of prime numbers \(p\) su...
We prove, that the sequence $1!, 2!, 3!, \dots$ produces at least $(\sqrt{2} - o(1))\sqrt{p}$ distin...
Let p be a prime number. Booker and Pomerance find an integer y with 1 < y ≤ p such that all non-zer...
As a consequence of Wilson’s theorem, the factorial ((p−1)/2) ! mod p provides a square root of (−...
International audienceWe explain how the Meissel-Lehmer-Lagarias-Miller-Odlyzko method for computing...
Abstract. In this article, we shall study a problem of the following nature. Given a natural number ...
AbstractLet p, q be primes and m be a positive integer. For a positive integer n, let ep(n) be the n...
Let p be a fixed odd prime and let s and t be fixed positive integers which depend on p. Consider th...
We present a new algorithm for residue multiplication modulo the Mersenne prime p = 2(521) - 1 based...
Computations of irregular primes and associated cyclotomic invariants were extended to all primes up...
AbstractLet a1, …, as be distinct non-zero residue classes modulo a prime p. In this paper we estima...
For a prime p = 1 (mod 3), the reduced residue system S3, modulo p, has a proper multiplicative subg...
Article 106078International audienceWe present improved algorithms for computing the left factorial ...
The left factorial of n is defined to be 0! + 1! + ··· + (n − 1)! and is denoted by !n. Kurepa conje...
Using A. Weil’s estimates the authors have given bounds for the largest prime P0 such that all prime...
We prove under a mild condition that Kurepa's conjecture holds for the set of prime numbers \(p\) su...
We prove, that the sequence $1!, 2!, 3!, \dots$ produces at least $(\sqrt{2} - o(1))\sqrt{p}$ distin...
Let p be a prime number. Booker and Pomerance find an integer y with 1 < y ≤ p such that all non-zer...
As a consequence of Wilson’s theorem, the factorial ((p−1)/2) ! mod p provides a square root of (−...
International audienceWe explain how the Meissel-Lehmer-Lagarias-Miller-Odlyzko method for computing...
Abstract. In this article, we shall study a problem of the following nature. Given a natural number ...
AbstractLet p, q be primes and m be a positive integer. For a positive integer n, let ep(n) be the n...
Let p be a fixed odd prime and let s and t be fixed positive integers which depend on p. Consider th...
We present a new algorithm for residue multiplication modulo the Mersenne prime p = 2(521) - 1 based...
Computations of irregular primes and associated cyclotomic invariants were extended to all primes up...
AbstractLet a1, …, as be distinct non-zero residue classes modulo a prime p. In this paper we estima...
For a prime p = 1 (mod 3), the reduced residue system S3, modulo p, has a proper multiplicative subg...