1) deceptive prime
虚伪素数
1.
In this paper we prove that there exist infinitely many deceptive primes n with n≡1(mod 4).
本文证明了, 存在无穷多个虚伪素数n适合n≡1 (mod 4)。
2) strong pseudoprimes
强伪素数
1.
Let N=q_1q_2q_3,q_1<q_2<q_3 be a 3 factors Carmicheal number,define C_(3,1)-and C_(3,2)-numbers,they respectively mean q_i=5 mod 8,i=1,2,3,and q_i≡5 mod 8,i=1,2,q_3≡9 mod 16,they also have a higher probability to be the strong pseudoprimes.
令N=q1q2q3,q1
2.
An algorithm is given,Using this algorithm can find out some numbers which are both Carmichael numbers and strong pseudoprimes to some prescribed bases.
对含有三个素因子的Ｃａｒｍｉｃｈａｅｌ数给出一种算法，利用此算法能探求一些Ｃａｒｍｉｃｈａｅｌ数，它们同时又是对一系列指定底的强伪素
3.
(Department of Mathematics, Anhui Normal University, Wuhu 241000)Abstract: Define ψ_m to be the smallest strong pseudoprimes to all the first m prime bases.
定义ψ_m是关于前m个素数基的最小强伪素数。
3) pseudoprime
伪素数
1.
This paper has approached for basic structure of the Pseudoprime,and a type pseudoprime has been structured according to the basic structure.
对伪素数的基本结构进行探讨，并按照基本结构具体构造出一类伪素
4) pseudoprime number
伪素数
1.
In this paper, it has been proved that every Mersenne composite number and Np = (2p + 1 ) /3 composite number is a pseudoprime number gain necessary and sufficient condition for discriminant pseudoprime number.
证明了任何Ｍｅｒｓｅｎｎｅ数Ｍｐ和任何数Ｎｐ＝（２ｐ＋１）／３都是素数或伪素数，获得了伪素数的计算公式及Ｍｐ与Ｎｐ为合数的充要条
2.
In this paper,according to the studying of Fermat number,firstly,we obtained the conclusion that the products of two different prime factors of every Fermat composite number Fn are pseudoprime number.
本文通过对费马数的研究,首先得出了任一费马合数Fn的两个不同素因子之积是伪素数,并把此结论进行推广,得出任一费马合数Fn的任意个不同素因子之积也是伪素数。
5) Carmicheal number
绝对伪素数
1.
On the determination and calculation of Carmicheal number;
关于绝对伪素数的判别与计算
补充资料：虚伪
【虚伪】
（术语）虚妄而不真实也。楞伽经三曰：“无垢虚伪妄想习气。”无量寿经下曰：“虚伪谄曲之心。”
（术语）虚妄而不真实也。楞伽经三曰：“无垢虚伪妄想习气。”无量寿经下曰：“虚伪谄曲之心。”
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条