Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A014233
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A014233 Smallest odd number for which Miller-Rabin primality test on bases <=p fails. +0
3
2047, 1373653, 25326001, 3215031751, 2152302898747, 3474749660383, 341550071728321, 341550071728321 (list; graph; listen)
OFFSET

1,1

REFERENCES

G. Jaeschke, On strong pseudoprimes to several bases, Math. Comp., 61 (1993), 915-926.

C. Pomerance et al., The pseudoprimes to 25.10^9, Math. Comp., 35 (1980), 1003-1026.

S. Wagon, Primality testing, Math. Intellig., 8 (No. 3, 1986), 58-61.

LINKS

A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996; see section 4.2.3, Miller-Rabin test.

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

F. Raynal, Miller-Rabin's Primality Test

K. Reinhardt, Miller-Rabin Primality Test for odd n

Wikipedia, Miller-Rabin primality test

CROSSREFS

Cf. A006945.

Same as A006945 except for first term.

Sequence in context: A075950 A022527 A024009 this_sequence A022193 A069386 A069412

Adjacent sequences: A014230 A014231 A014232 this_sequence A014234 A014235 A014236

KEYWORD

nonn

AUTHOR

j.mccranie(AT)comcast.net (Jud Mccranie)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 4 18:25 EDT 2008. Contains 140886 sequences.


AT&T Labs Research