Search Results for ""
11 - 20 of 887 for Full Reptend PrimesSearch Results
Like the entire harmonic series, the harmonic series sum_(k=1)^infty1/(p_k)=infty (1) taken over all primes p_k also diverges, as first shown by Euler in 1737 (Nagell 1951, ...
Pairs of primes of the form (p, p+4) are called cousin primes. The first few are (3, 7), (7, 11), (13, 17), (19, 23), (37, 41), (43, 47), (67, 71), ... (OEIS A023200 and ...
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 ...
Following Yates (1980), a prime p such that 1/p is a repeating decimal with decimal period shared with no other prime is called a unique prime. For example, 3, 11, 37, and ...
A generalization by Kronecker of Kummer's theory of prime ideal factors. A divisor on a full subcategory C of mod(A) is an additive mapping chi on C with values in a ...
A prime number (or prime integer, often simply called a "prime" for short) is a positive integer p>1 that has no positive integer divisors other than 1 and p itself. More ...
A primitive root of a prime p is an integer g such that g (mod p) has multiplicative order p-1 (Ribenboim 1996, p. 22). More generally, if GCD(g,n)=1 (g and n are relatively ...
Let n be a positive number having primitive roots. If g is a primitive root of n, then the numbers 1, g, g^2, ..., g^(phi(n)-1) form a reduced residue system modulo n, where ...
The apodization function A(x)=cos((pix)/(2a)). Its full width at half maximum is 4a/3. Its instrument function is I(k)=(4acos(2piak))/(pi(1-16a^2k^2)), which has a maximum of ...
If {a_0,a_1,...} is a recursive sequence, then the set of all k such that a_k=0 is the union of a finite (possibly empty) set and a finite number (possibly zero) of full ...
...
View search results from all Wolfram sites (10913 matches)

