Search Results for ""

The geometric mean is smaller than the arithmetic mean, (product_(i=1)^Nn_i)^(1/N)<=(sum_(i=1)^(N)n_i)/N, with equality in the cases (1) N=1 or (2) n_i=n_j for all i,j.

The Season 2 episode "Soft Target" (2006) of the television crime drama NUMB3RS features linear discriminant analysis.

If the first case of Fermat's last theorem is false for the prime exponent p, then 3^(p-1)=1 (mod p^2).

An elliptic curve of the form y^2=x^3+n for n an integer. This equation has a finite number of solutions in integers for all nonzero n. If (x,y) is a solution, it therefore ...

An NSW number (named after Newman, Shanks, and Williams) is an integer m that solves the Diophantine equation 2n^2=m^2+1. (1) In other words, the NSW numbers m index the ...

There are several related theorems involving Hamiltonian cycles of graphs that are associated with Pósa. Let G be a simple graph with n graph vertices. 1. If, for every k in ...

p^~=|phi_i(x)><phi_i(t)| (1) p^~sum_(j)c_j|phi_j(t)>=c_i|phi_i(x)> (2) sum_(i)|phi_i(x)><phi_i(x)|=1. (3)

Ramanujan's two-variable theta function f(a,b) is defined by f(a,b)=sum_(n=-infty)^inftya^(n(n+1)/2)b^(n(n-1)/2) (1) for |ab|<1 (Berndt 1985, p. 34; Berndt et al. 2000). It ...

Somos's quadratic recurrence constant is defined via the sequence g_n=ng_(n-1)^2 (1) with g_0=1. This has closed-form solution ...

For a right triangle with legs a and b and hypotenuse c, a^2+b^2=c^2. (1) Many different proofs exist for this most fundamental of all geometric theorems. The theorem can ...