Search Results for ""

Hilbert's problems are a set of (originally) unsolved problems in mathematics proposed by Hilbert. Of the 23 total appearing in the printed address, ten were actually ...

The prime number theorem gives an asymptotic form for the prime counting function pi(n), which counts the number of primes less than some integer n. Legendre (1808) suggested ...

The set of roots of a polynomial f(x,y,z)=0. An algebraic surface is said to be of degree n=max(i+j+k), where n is the maximum sum of powers of all terms ...

A Bessel function of the second kind Y_n(x) (e.g, Gradshteyn and Ryzhik 2000, p. 703, eqn. 6.649.1), sometimes also denoted N_n(x) (e.g, Gradshteyn and Ryzhik 2000, p. 657, ...

Draw lines P_AQ_A, P_BQ_B, and P_CQ_C through the symmedian point K and parallel to the sides of the triangle DeltaABC. The points where the parallel lines intersect the ...

Infinity, most often denoted as infty, is an unbounded quantity that is greater than every real number. The symbol infty had been used as an alternative to M (1000) in Roman ...

The quantities obtained from cubic, hexagonal, etc., lattice sums, evaluated at s=1, are called Madelung constants. For cubic lattice sums ...

Mills (1947) proved the existence of a real constant A such that |_A^(3^n)_| (1) is prime for all integers n>=1, where |_x_| is the floor function. Mills (1947) did not, ...

Multivariate zeta function, also called multiple zeta values, multivariate zeta constants (Bailey et al. 2006, p. 43), multi-zeta values (Bailey et al. 2006, p. 17), and ...

A prime magic square is a magic square consisting only of prime numbers (although the number 1 is sometimes allowed in such squares). The left square is the 3×3 prime magic ...