Search Results for ""
3661 - 3670 of 4569 for Complex numbersSearch Results
The end of the last gap in the Lagrange spectrum, given by F=(2221564096+283748sqrt(462))/(491993569)=4.5278295661... (OEIS A118472). Real numbers greater than F are members ...
In general, a frieze consists of repeated copies of a single motif. b ; a d; c Conway and Guy (1996) define a frieze pattern as an arrangement of numbers at the intersection ...
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 4×4 magic square in which the elements in each 2×2 corner have the same sum. Dürer's magic square, illustrated above, is an example of a gnomon magic square since the sums ...
A prime p_n is called "good" if p_n^2>p_(n-i)p_(n+i) for all 1<=i<=n-1 (there is a typo in Guy 1994 in which the is are replaced by 1s). There are infinitely many good ...
For any positive integer k, there exists a prime arithmetic progression of length k. The proof is an extension of Szemerédi's theorem.
Let sigma(n) be the divisor function. Then lim sup_(n->infty)(sigma(n))/(nlnlnn)=e^gamma, where gamma is the Euler-Mascheroni constant. Ramanujan independently discovered a ...
For a prime constellation, the Hardy-Littlewood constant for that constellation is the coefficient of the leading term of the (conjectured) asymptotic estimate of its ...
The Hermite constant is defined for dimension n as the value gamma_n=(sup_(f)min_(x_i)f(x_1,x_2,...,x_n))/([discriminant(f)]^(1/n)) (1) (Le Lionnais 1983). In other words, ...
An integer n>1 is said to be highly cototient if the equation x-phi(x)=n has more solutions than the equations x-phi(x)=k for all 1<k<n, where phi is the totient function. ...
...
View search results from all Wolfram sites (46785 matches)

