Search: id:A014233
Results 1-1 of 1 results found.

%I A014233
%S A014233 2047,1373653,25326001,3215031751,2152302898747,3474749660383,
%T A014233 341550071728321,341550071728321
%N A014233 Smallest odd number for which Miller-Rabin primality test on bases <= 
               n-th prime fails.
%C A014233 Note that some terms are repeated.
%D A014233 R. Crandall and C. Pomerance, Prime Numbers: A Computational Perspective, 
               Springer, NY, 2001; see p. 157.
%D A014233 G. Jaeschke, On strong pseudoprimes to several bases, Math. Comp., 61 
               (1993), 915-926.
%D A014233 C. Pomerance, J. L. Selfridge and S. S. Wagstaff, Jr., "The pseudoprimes 
               to 25.10^9", Mathematics of Computation 35 (1980), pp. 1003-1026.
%D A014233 S. Wagon, Primality testing, Math. Intellig., 8 (No. 3, 1986), 58-61.
%D A014233 Zhenxiang Zhang and Min Tang, "Finding strong pseudoprimes to several 
               bases. II", Mathematics of Computation 72 (2003), pp. 2085-2097.
%H A014233 Joerg Arndt, <a href="http://www.jjj.de/fxt/#fxtbook">Fxtbook</a>
%H A014233 A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, <a href="http:/
               /www.cacr.math.uwaterloo.ca/hac/">Handbook of Applied Cryptography</
               a>, CRC Press, 1996; see section 4.2.3, Miller-Rabin test.
%H A014233 F. Raynal, <a href="http://www.security-labs.org/full-page.php3?page=5">
               Miller-Rabin's Primality Test</a>
%H A014233 K. Reinhardt, <a href="http://www-fs.informatik.uni-tuebingen.de/~reinhard/
               krypto/English/2.3.1.e.html">Miller-Rabin Primality Test for odd 
               n</a>
%H A014233 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               StrongPseudoprime.html">Link to a section of The World of Mathematics.</
               a>
%H A014233 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               Rabin-MillerStrongPseudoprimeTest.html">Link to a section of The 
               World of Mathematics.</a>
%H A014233 Wikipedia, <a href="http://en.wikipedia.org/wiki/Miller-Rabin_primality_test">
               Miller-Rabin primality test</a>
%H A014233 Author?, <a href="http://math.crg4.com/primes.html">Finding small prime 
               numbers</a>
%H A014233 <a href="Sindx_Ps.html#pseudoprimes">Index entries for sequences related 
               to pseudoprimes</a>
%Y A014233 Same as A006945 except for first term.
%Y A014233 Sequence in context: A075950 A022527 A024009 this_sequence A022193 A069386 
               A069412
%Y A014233 Adjacent sequences: A014230 A014231 A014232 this_sequence A014234 A014235 
               A014236
%K A014233 nonn
%O A014233 1,1
%A A014233 Jud McCranie (j.mccranie(AT)comcast.net) Feb 15 1997
%E A014233 Minor edits from N. J. A. Sloane, Jun 20 2009
%E A014233 Deleted unconfirmed entries that were taken from the "Finding small prime 
               numbers" web page. - Tomasz Czajka (tomekczajka81(AT)gmail.com), 
               Jun 25 2009

Search completed in 0.001 seconds