论文信息 - The primality of R1031 - 字舞流文

The primality of R1031

On decrit une technique permettant de demontrer que le nombre R1031(=(10 1031 -1)(9) compose uniquement de 1 est premier

Harvey Dubner | Hugh C. Williams

[1] A. K. Lenstra,et al. Implementation of a New Primality Test , 1985 .

[2] H. Lenstra,et al. Primalitv Testing and Jacobi Sums , 2010 .

[3] H. C. Williams,et al. Determination of the primality of by using factors of ²±1 , 1976 .

[4] H. C. Williams,et al. A generalization of Lehmer's functions , 1976 .

[5] J. Pollard. A monte carlo method for factorization , 1975 .

[6] L. Adleman,et al. On distinguishing prime numbers from composite numbers , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[7] R. Brent,et al. Factorization of the eighth Fermat number , 1981 .

[8] D. H. Lehmer,et al. New primality criteria and factorizations of 2^{}±1 , 1975 .

[9] Faculteit der Wiskunde en Natuurwetenschappen,et al. Divisors in residue classes , 1983 .

[10] H. C. Williams,et al. Factoring on a Computer , 1984 .

[11] Hugh C. Williams,et al. Some algorithms for prime testing using generalized Lehmer functions , 1976 .

[12] H. C. Williams,et al. Some observations on primality testing , 1978 .

[13] H. C. Williams,et al. Some primes of the form (ⁿ-1)/(-1) , 1979 .

[14] J. M. Pollard,et al. Theorems on factorization and primality testing , 1974, Mathematical Proceedings of the Cambridge Philosophical Society.