pseudoprime number
Смотреть что такое "pseudoprime number" в других словарях:
Pseudoprime — A pseudoprime is a probable prime (an integer which shares a property common to all prime numbers) which is not actually prime. Pseudoprimes can be classified according to which property they satisfy.The most important class of pseudoprimes come… … Wikipedia
pseudoprime — 1. noun An integer that possesses at least one characteristic of a prime number without actually being prime. 2. adjective Describing such an integer … Wiktionary
Lucas pseudoprime — In number theory, the classes of Lucas pseudoprime and Fibonacci pseudoprime comprise sequences of composite integers that passes certain tests that all primes pass: in this case, criteria relative to some Lucas sequence.DefinitionGiven two… … Wikipedia
Strong pseudoprime — In number theory, a strong pseudoprime is a composite number that passes a pseudoprimality test. All primes pass this test, but a small fraction of composites pass as well, making them false primes . Unlike the Fermat pseudoprimes, for which… … Wikipedia
Euler pseudoprime — An odd composite integer n is called an Euler pseudoprime to base a , if a and n are coprime, and : a^{(n 1)/2} equiv pm 1pmod{n}(where mod refers to the modulo operation).The motivation for this definition is the fact that all prime numbers p… … Wikipedia
List of number theory topics — This is a list of number theory topics, by Wikipedia page. See also List of recreational number theory topics Topics in cryptography Contents 1 Factors 2 Fractions 3 Modular arithmetic … Wikipedia
Euler-Jacobi pseudoprime — In number theory, an odd composite integer n is called an Euler Jacobi pseudoprime to base a , if a and n are coprime, and : a ( n − 1)/2 = ( a / n ) (mod n ), where ( a / n ) is the Jacobi symbol.The motivation for this definition is the fact… … Wikipedia
Fermat number — In mathematics, a Fermat number, named after Pierre de Fermat who first studied them, is a positive integer of the form:F {n} = 2^{2^{ overset{n} {} + 1where n is a nonnegative integer. The first nine Fermat numbers are OEIS|id=A000215:As of|2008 … Wikipedia
Frobenius pseudoprime — In number theory, a Frobenius pseudoprime is a composite number which passes a three step probable prime test set out by Jon Grantham in section 3 of his paper Frobenius pseudoprimes . [Jon Grantham. [http://www.pseudoprime.com/pseudo1.pdf… … Wikipedia
Perrin number — In mathematics, the Perrin numbers are defined by the recurrence relation: P (0) = 3, P (1) = 0, P (2) = 2, and : P ( n ) = P ( n − 2) + P ( n − 3) for n > 2.The series begins:3, 0, 2, 3, 2, 5, 5, 7, 10, 12, 17, 22, 29, 39 ... OEIS|id=A001608The… … Wikipedia
Somer-Lucas pseudoprime — In mathematics, in particular number theory, an odd composite number N is a Somer Lucas d pseudoprime (with given dle 1) if there exists a nondegenerate Lucas sequence :U(P,Q) with :U 0=0, U 1=1, D=P^2 4Q, such that :(N,D)=1 and the rank… … Wikipedia
