1) strong proable primes
强概素数
1.
All M(a,p) for 2≤a≤101,p≤101 were got when M(a,p) are primes or strong proable primes.
主要讨论了广义Mersenne数M(a,p)=ap-1/a-1(a是大于1的正整数,p是奇素数)的几个性质,并由此提出了搜寻这种形式素数的一个算法,给出了所有满足2≤a≤101,p≤101的素数和强概素数。
2) probable prime
概素数
1.
This paper discusses the properties of numbers of the form (2 p +1)/3 and gives primes and probable prime for p <6000.
设ｐ为奇素数，本文讨论（２ｐ＋１）／３的基本性质，并对ｐ＜６０００给出了素数和概素
3) have a head for figures
数字概念强
4) strong prime
强素数
1.
In this paper,we give a deterministic time algorithm that determines whether a kind of prime is a strong prime.
给出了确定一类素数p是否为强素数的多项式时间算法,其计算量为O(log32p),并给出了生成这类强素数的算法。
2.
So we must use strong prime and use the key pair which have as many as possible of bits.
对此必须使用强素数并采用尽量大数位的密钥对。
5) 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个素数基的最小强伪素数。
补充资料：椐椐强强
1.相随貌。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条