Search Results for ""

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

The quantity ps-rq obtained by letting x = pX+qY (1) y = rX+sY (2) in ax^2+2bxy+cy^2 (3) so that A = ap^2+2bpr+cr^2 (4) B = apq+b(ps+qr)+crs (5) C = aq^2+2bqs+cs^2 (6) and ...

The quadratic embedding constant QEC(G) of a finite simple connected graph G on n vertices is defined as the maximum of the product vDv over all real n-vectors v satisfying ...

If A=(a_(ij)) is a diagonal matrix, then Q(v)=v^(T)Av=suma_(ii)v_i^2 (1) is a diagonal quadratic form, and Q(v,w)=v^(T)Aw is its associated diagonal symmetric bilinear form. ...

The determinant of a binary quadratic form Au^2+2Buv+Cv^2 is defined as D=AC-B^2. It is equal to 1/4 of the corresponding binary quadratic form discriminant. Unfortunately, ...

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

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