Search Results for ""

For a real number x in (0,1), let m be the number of terms in the convergent to a regular continued fraction that are required to represent n decimal places of x. Then for ...

Given F_1(x,y,z,u,v,w) = 0 (1) F_2(x,y,z,u,v,w) = 0 (2) F_3(x,y,z,u,v,w) = 0, (3) if the determinantof the Jacobian |JF(u,v,w)|=|(partial(F_1,F_2,F_3))/(partial(u,v,w))|!=0, ...

If all elements a_(ij) of an irreducible matrix A are nonnegative, then R=minM_lambda is an eigenvalue of A and all the eigenvalues of A lie on the disk |z|<=R, where, if ...

A figurate number of the form 4n^2-3n. The first few are 1, 10, 27, 52, 85, ... (OEIS A001107). The generating function giving the decagonal numbers is ...

An odd power is a number of the form m^n for m>0 an integer and n a positive odd integer. The first few odd powers are 1, 8, 27, 32, 64, 125, 128, 216, 243, 343, 512, ... ...

Let X_1,X_2,...,X_N be a set of N independent random variates and each X_i have an arbitrary probability distribution P(x_1,...,x_N) with mean mu_i and a finite variance ...

As originally stated by Gould (1972), GCD{(n-1; k),(n; k-1),(n+1; k+1)} =GCD{(n-1; k-1),(n; k+1),(n+1; k)}, (1) where GCD is the greatest common divisor and (n; k) is a ...

In April 1999, Ed Pegg conjectured on sci.math that there were only finitely many zerofree cubes, to which D. Hickerson responded with a counterexample. A few days later, Lew ...

A strong pseudoprime to a base a is an odd composite number n with n-1=d·2^s (for d odd) for which either a^d=1 (mod n) (1) or a^(d·2^r)=-1 (mod n) (2) for some r=0, 1, ..., ...

The perpendicular bisector of a line segment is the locus of all points that are equidistant from its endpoints. This theorem can be applied to determine the center of a ...