Search Results for ""

The kernel of a symmetric bilinear form Q:V×V-->R is the set Ker(Q)={v in V|Q(v,w)=0 for all w in V}.

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

An algorithm for computing an Egyptian fraction (Stewart 1992).

A polynomial with 2 terms.

A convex planar domain in which the minimal generalized diameter is >1 always contains a circle of radius 1/3.

A (symmetrical) boundary set of radius r and center x_0 is the set of all points x such that |x-x_0|=r. Let x_0 be the origin. In R^1, the boundary set is then the pair of ...

Brun's sieve was refined by J. B. Rosser, G. Ricci, and others.

The points on a line can be put into a one-to-one correspondence with the real numbers.

The Cauchy product of two sequences f(n) and g(n) defined for nonnegative integers n is defined by (f degreesg)(n)=sum_(k=0)^nf(k)g(n-k).

Any row r and column s of a determinant being selected, if the element common to them be multiplied by its cofactor in the determinant, and every product of another element ...