Search Results for ""
301 - 310 of 729 for modular sieve methodSearch Results
Informally, an elliptic curve is a type of cubic curve whose solutions are confined to a region of space that is topologically equivalent to a torus. The Weierstrass elliptic ...
A prime gap of length n is a run of n-1 consecutive composite numbers between two successive primes. Therefore, the difference between two successive primes p_k and p_(k+1) ...
A number of attractive tetrahedron 5-compounds can be constructed. The first (left figures) is one of the icosahedron stellations in which the 5×4 vertices of the tetrahedra ...
There are several types of numbers that are commonly termed "lucky numbers." The first is the lucky numbers of Euler. The second is obtained by writing out all odd numbers: ...
The Taniyama-Shimura conjecture, since its proof now sometimes known as the modularity theorem, is very general and important conjecture (and now theorem) connecting topology ...
The divisor function sigma_k(n) for n an integer is defined as the sum of the kth powers of the (positive integer) divisors of n, sigma_k(n)=sum_(d|n)d^k. (1) It is ...
A group whose left Haar measure equals its right Haar measure.
It is possible to perform multiplication of large numbers in (many) fewer operations than the usual brute-force technique of "long multiplication." As discovered by Karatsuba ...
Rule 90 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...
Define E(x;q,a)=psi(x;q,a)-x/(phi(q)), (1) where psi(x;q,a)=sum_(n<=x; n=a (mod q))Lambda(n) (2) (Davenport 1980, p. 121), Lambda(n) is the Mangoldt function, and phi(q) is ...
...
View search results from all Wolfram sites (18470 matches)

