请输入您要查询的字词:

 

单词 Pseudoprime
释义

Pseudoprime

A pseudoprime is a Composite number which passes a test or sequence of tests which fail for most Composite numbers.Unfortunately, some authors drop the ``Composite'' requirement, calling any number which passes the specified tests apseudoprime even if it is Prime. Pomerance, Selfridge, and Wagstaff (1980) restrict their use of ``pseudoprime'' to OddComposite numbers. ``Pseudoprime'' used without qualification means Fermat Pseudoprime.


Carmichael Numbers are Odd Composite numbers which are pseudoprimes to every base; they aresometimes called Absolute Pseudoprimes. The following table gives the number ofFermat Pseudoprimes psp, Euler Pseudoprimes epsp, andStrong Pseudoprimes spsp to the base 2, as well as Carmichael Numbers CN which are less the first few powers of 10 (Guy 1994).


psp(2)322782457502057559714884
epsp(2)11236114375107129397706
spsp(2)05164616248812823291
CN1716431052556461547

See also Carmichael Number, Elliptic Pseudoprime, Euler Pseudoprime, Euler-Jacobi Pseudoprime,Extra Strong Lucas Pseudoprime, Fermat Pseudoprime, Fibonacci Pseudoprime, FrobeniusPseudoprime, Lucas Pseudoprime, Perrin Pseudoprime, Probable Prime, Somer-Lucas Pseudoprime,Strong Elliptic Pseudoprime, Strong Frobenius Pseudoprime, Strong LucasPseudoprime, Strong Pseudoprime


References

Grantham, J. ``Frobenius Pseudoprimes.'' http://www.clark.net/pub/grantham/pseudo/pseudo1.ps

Grantham, J. ``Pseudoprimes/Probable Primes.'' http://www.clark.net/pub/grantham/pseudo.

Guy, R. K. ``Pseudoprimes. Euler Pseudoprimes. Strong Pseudoprimes.'' §A12 in Unsolved Problems in Number Theory, 2nd ed. New York: Springer-Verlag, pp. 27-30, 1994.

Pomerance, C.; Selfridge, J. L.; and Wagstaff, S. S. ``The Pseudoprimes to .'' Math. Comput. 35, 1003-1026, 1980. Available electronically from ftp://sable.ox.ac.uk/pub/math/primes/ps2.Z.


随便看

 

数学辞典收录了8975条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2024/11/15 7:20:15