单词 | Poulet Number |
释义 | Poulet NumberA Fermat Pseudoprime to base 2, denoted psp(2), i.e., a Composite Odd Integer such that ![]() The first few Poulet numbers are 341, 561, 645, 1105, 1387, ... (Sloane's A001567). Pomerance et al. (1980) computed all21,853 Poulet numbers less than ![]() Pomerance has shown that the number of Poulet numbers less than ![]() (Guy 1994). A Poulet number all of whose Divisors
Guy, R. K. Unsolved Problems in Number Theory, 2nd ed. New York: Springer-Verlag, pp. 28-29, 1994. Pomerance, C.; Selfridge, J. L.; and Wagstaff, S. S. Jr. ``The Pseudoprimes to Shanks, D. Solved and Unsolved Problems in Number Theory, 4th ed. New York: Chelsea, pp. 115-117, 1993. Sloane, N. J. A. SequenceA001567/M5441in ``An On-Line Version of the Encyclopedia of Integer Sequences.''http://www.research.att.com/~njas/sequences/eisonline.html and Sloane, N. J. A. and Plouffe, S.The Encyclopedia of Integer Sequences. San Diego: Academic Press, 1995. |
随便看 |
|
数学辞典收录了8975条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。