Search Results for ""

The discriminant of a binary quadratic form au^2+buv+cv^2 is defined by d=4ac-b^2. It is equal to four times the corresponding binary quadratic form determinant. ...

The use of three prior points in a root-finding algorithm to estimate the zero crossing.

A transformation of a hypergeometric function,

A quadratic form Q(x) is said to be positive semidefinite if it is never <0. However, unlike a positive definite quadratic form, there may exist a x!=0 such that the form is ...

An affine isoperimetric inequality.

Let pi_(m,n)(x) denote the number of primes <=x which are congruent to n modulo m (i.e., the modular prime counting function). Then one might expect that ...

If 0<=a,b,c,d<=1, then (1-a)(1-b)(1-c)(1-d)+a+b+c+d>=1. This is a special case of the general inequality product_(i=1)^n(1-a_i)+sum_(i=1)^na_i>=1 for 0<=a_1,a_2,...,a_n<=1. ...

If a_1>=a_2>=...>=a_n (1) b_1>=b_2>=...>=b_n, (2) then nsum_(k=1)^na_kb_k>=(sum_(k=1)^na_k)(sum_(k=1)^nb_k). (3) This is true for any distribution.

A quadratic form Q(z) is said to be positive definite if Q(z)>0 for z!=0. A real quadratic form in n variables is positive definite iff its canonical form is ...

The square root inequality states that 2sqrt(n+1)-2sqrt(n)<1/(sqrt(n))<2sqrt(n)-2sqrt(n-1) for n>=1.