2
Download:
|
|
by Preda Mihailescu, Chris Nash, Aerotek Ce/lexmark International, Gamma F \delta R
http://www.inf.ethz.ch/~mihailes/papers/factsLL.ps.gz
Add To MetaCart
Abstract:
Abstract. Let n be a probable prime, such that n k
Citations
| 2739 | A mathematical theory of communication – Shannon - 1948 |
| 26 | Finding irreducible polynomials over finite fields – Adleman, Lenstra - 1986 |
| 15 | A Library for Computational Number Theory – Group - 1997 |
| 6 | New Fibonacci and Lucas primes – DUBNER, KELLER - 1999 |
| 3 | Cyclotomy of Rings & Primality Testing", dissertation 12278 – Mihailescu - 1997 |
| 1 | J.Shallit: "Algorithmic Number Theory", foundation of computer science series – Bach - 1996 |
| 1 | Introduction to Coding Theory", Graduate Texts – Lint - 1999 |
| 1 | Primes of the form n! \Sigma 1 and 2 \Delta 3 \Delta 5 : : : p \Sigma 1 – Buhler, Crandall, et al. - 1982 |
| 1 | On the primality of n! \Sigma 1 and 2 \Delta 3 \Delta 5 : : : p \Sigma 1", submitted – Caldwell - 1999 |
