请输入您要查询的字词:

 

单词 PerrinPseudoprime
释义

Perrin pseudoprime


Given the Perrin sequenceMathworldPlanetmath, a0=3, a1=0, a2=2 and an=an-3+an-2 for n>2, if n is not prime yet n|an, that number is then called a Perrin pseudoprimeMathworldPlanetmath. The first few Perrin pseudoprimes are 271441, 904631, 16532714, 24658561, 27422714, 27664033, 46672291 (listed in A013998 of Sloane’s OEIS).

By itself this is not a good enough test of primality. Further requiring that an0modn and a-n1modn improves the test but not enough to be preferable to actually factoring out the number. The first few strong Perrin pseudoprimes are 27664033, 46672291, 102690901, 130944133, 517697641 (listed in A018187 of Sloane’s OEIS).

Unlike Perrin pseudoprimes, most other pseudoprimesMathworldPlanetmathPlanetmath (http://planetmath.org/PseudoprimeP) are because of a congruence relationPlanetmathPlanetmath to a given base.

随便看

 

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

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 17:49:23