Search Results for ""
341 - 350 of 729 for modular sieve methodSearch Results
A Chen prime is a prime number p for which p+2 is either a prime or semiprime. Chen primes are named after Jing Run Chen who proved in 1966 that there are infinitely many ...
A Fermat prime is a Fermat number F_n=2^(2^n)+1 that is prime. Fermat primes are therefore near-square primes. Fermat conjectured in 1650 that every Fermat number is prime ...
If r is an algebraic number of degree n, then the totality of all expressions that can be constructed from r by repeated additions, subtractions, multiplications, and ...
The Rogers-Ramanujan continued fraction is a generalized continued fraction defined by R(q)=(q^(1/5))/(1+q/(1+(q^2)/(1+(q^3)/(1+...)))) (1) (Rogers 1894, Ramanujan 1957, ...
pi may be computed using a number of iterative algorithms. The best known such algorithms are the Archimedes algorithm, which was derived by Pfaff in 1800, and the ...
A lattice which satisfies the identities (x ^ y) v (x ^ z)=x ^ (y v z) (x v y) ^ (x v z)=x v (y ^ z) is said to be distributive.
A parameter n used to specify an elliptic integral of the third kind Pi(n;phi,k).
An equation is a mathematical expression stating that two or more quantities are the same as one another, also called an equality, formula, or identity.
A set of residues {a_1,a_2,...,a_(k+1)} (mod n) such that every nonzero residue can be uniquely expressed in the form a_i-a_j. Examples include {1,2,4} (mod 7) and {1,2,5,7} ...
Arithmetic is the branch of mathematics dealing with integers or, more generally, numerical computation. Arithmetical operations include addition, congruence calculation, ...
...
View search results from all Wolfram sites (18470 matches)

