Search Results for ""

Lucas's theorem states that if n>=3 be a squarefree integer and Phi_n(z) a cyclotomic polynomial, then Phi_n(z)=U_n^2(z)-(-1)^((n-1)/2)nzV_n^2(z), (1) where U_n(z) and V_n(z) ...

Marion's theorem (Mathematics Teacher 1993, Maushard 1994, Morgan 1994) states that the area of the central hexagonal region determined by trisection of each side of a ...

If x takes only nonnegative values, then P(x>=a)<=(<x>)/a. (1) To prove the theorem, write <x> = int_0^inftyxP(x)dx (2) = int_0^axP(x)dx+int_a^inftyxP(x)dx. (3) Since P(x) is ...

The inverse of a square matrix A, sometimes called a reciprocal matrix, is a matrix A^(-1) such that AA^(-1)=I, (1) where I is the identity matrix. Courant and Hilbert (1989, ...

The Mertens constant B_1, also known as the Hadamard-de la Vallee-Poussin constant, prime reciprocal constant (Bach and Shallit 1996, p. 234), or Kronecker's constant ...

Consider the Euler product zeta(s)=product_(k=1)^infty1/(1-1/(p_k^s)), (1) where zeta(s) is the Riemann zeta function and p_k is the kth prime. zeta(1)=infty, but taking the ...

Roughly speaking, the metric tensor g_(ij) is a function which tells how to compute the distance between any two points in a given space. Its components can be viewed as ...

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, ...

The fundamental theorem of game theory which states that every finite, zero-sum, two-person game has optimal mixed strategies. It was proved by John von Neumann in 1928. ...

Minkowski's conjecture states that every lattice tiling of R^n by unit hypercubes contains two hypercubes that meet in an (n-1)-dimensional face. Minkowski first considered ...