Search Results for ""
101 - 110 of 4275 for Prime zeta functionSearch Results
In the 1980s, Samuel Yates defined a titanic prime to be a prime number of at least 1000 decimal digits. The smallest titanic prime is 10^(999)+7. As of 1990, more than 1400 ...
Gaussian primes are Gaussian integers z=a+bi satisfying one of the following properties. 1. If both a and b are nonzero then, a+bi is a Gaussian prime iff a^2+b^2 is an ...
A Proth number that is prime, i.e., a number of the form N=k·2^n+1 for odd k, n a positive integer, and 2^n>k. Factors of Fermat numbers are of this form as long as they ...
A gigantic prime is a prime with 10000 or more decimal digits. The first few gigantic primes are given by 10^(9999)+n for n=33603, 55377, 70999, 78571, 97779, 131673, 139579, ...
A Belphegor prime (also known as a Beelphegor prime) is a prime Belphegor number, i.e., a palindromic prime of the form 1(0...)666(0...)1. The first few Belphegor primes are ...
A prime which does not divide the class number h(p) of the cyclotomic field obtained by adjoining a primitive pth root of unity to the field of rationals. A prime p is ...
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 prime p is called a Wolstenholme prime if the central binomial coefficient (2p; p)=2 (mod p^4), (1) or equivalently if B_(p-3)=0 (mod p), (2) where B_n is the nth Bernoulli ...
The longstanding conjecture that the nonimaginary solutions E_n of zeta(1/2+iE_n)=0, (1) where zeta(z) is the Riemann zeta function, are the eigenvalues of an "appropriate" ...
There are two definitions of the Carmichael function. One is the reduced totient function (also called the least universal exponent function), defined as the smallest integer ...
...
View search results from all Wolfram sites (418515 matches)

