Search Results for ""

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

The two recursive sequences U_n = mU_(n-1)+U_(n-2) (1) V_n = mV_(n-1)+V_(n-2) (2) with U_0=0, U_1=1 and V_0=2, V_1=m, can be solved for the individual U_n and V_n. They are ...

If M^3 is a closed oriented connected 3-manifold such that every simple closed curve in M lies interior to a ball in M, then M is homeomorphic with the hypersphere, S^3.

A sequence of polynomials p_n satisfying the identities p_n(x+y)=sum_(k>=0)(n; k)p_k(x)p_(n-k)(y).

A polynomial with 2 terms.

There are several closely related results that are variously known as the binomial theorem depending on the source. Even more confusingly a number of these (and other) ...

If two complementary Plücker characteristics are equal, then each characteristic is equal to its complement except in four cases where the sum of order and class is 9.

The image of A_5×A_5 in the special orthogonal group SO(4), where A_5 is the icosahedral group.

If there is an integer x such that x^4=q (mod p), then q is said to be a biquadratic residue (mod p). If not, q is said to be a biquadratic nonresidue (mod p).

A transformation in which coordinates in two spaces are expressed rationally in terms of those in another.