Search Results for ""

An algorithm for computing an Egyptian fraction.

There are two different definitions of generalized Fermat numbers, one of which is more general than the other. Ribenboim (1996, pp. 89 and 359-360) defines a generalized ...

The proposition that every consistent generalized theory has a model. The theorem is true if the axiom of choice is assumed.

A algebraic loop L is a generalized Bol loop if for all elements x, y, and z of L, ((xy)z)alpha(y)=x((yz)alpha(y)) for some map alpha:L->L. As the name suggests, these are ...

A generalization of the Fibonacci numbers defined by 1=G_1=G_2=...=G_(c-1) and the recurrence relation G_n=G_(n-1)+G_(n-c). (1) These are the sums of elements on successive ...

A generalized Moore graph is a regular graph of degree r where the counts of vertices at each distance d=0, 1, ... from any vertex are 1, r, r(r-1), r(r-1)^2, r(r-1)^3, ..., ...

If r experiments are performed with n_i possible outcomes for each experiment i=1,2,...,r, then there are a total of product_(i=1)^(r)n_i possible outcomes.

The generalized law of sines applies to a simplex in space of any dimension with constant Gaussian curvature. Let us work up to that. Initially in two-dimensional space, we ...

The generalized Riemann hypothesis conjectures that neither the Riemann zeta function nor any Dirichlet L-series has a zero with real part larger than 1/2. Compare with ...

A generalization of the polylogarithm function defined by S_(n,p)(z)=((-1)^(n+p-1))/((n-1)!p!)int_0^1((lnt)^(n-1)[ln(1-zt)]^p)/tdt. The function reduces to the usual ...