Search Results for ""

A set of generators (g_1,...,g_n) is a set of group elements such that possibly repeated application of the generators on themselves and each other is capable of producing ...

A rule for polynomial computation which both reduces the number of necessary multiplications and results in less numerical instability due to potential subtraction of one ...

The first few numbers whose abundance absolute values are odd squares (excluding the trivial cases of powers of 2) are 98, 2116, 4232, 49928, 80656, 140450, 550564, 729632, ...

If a function analytic at the origin has no singularities other than poles for finite x, and if we can choose a sequence of contours C_m about z=0 tending to infinity such ...

_3F_2[n,-x,-y; x+n+1,y+n+1] =Gamma(x+n+1)Gamma(y+n+1)Gamma(1/2n+1)Gamma(x+y+1/2n+1) ×Gamma(n+1)Gamma(x+y+n+1)Gamma(x+1/2n+1)Gamma(y+1/2n+1), (1) where _3F_2(a,b,c;d,e;z) is a ...

The differential equation describing exponential growth is (dN)/(dt)=rN. (1) This can be integrated directly int_(N_0)^N(dN)/N=int_0^trdt (2) to give ln(N/(N_0))=rt, (3) ...

A number of the form 2^n that contains the digits 666 (i.e., the beast number) is called an apocalyptic number. 2^(157) is an apocalyptic number. The first few such powers ...

The Franel numbers are the numbers Fr_n=sum_(k=0)^n(n; k)^3, (1) where (n; k) is a binomial coefficient. The first few values for n=0, 1, ... are 1, 2, 10, 56, 346, ... (OEIS ...

Let ad=bc, then (1) This can also be expressed by defining (2) (3) Then F_(2m)(a,b,c,d)=a^(2m)f_(2m)(x,y), (4) and identity (1) can then be written ...

The fraction of odd values of the partition function P(n) is roughly 50%, independent of n, whereas odd values of Q(n) occur with ever decreasing frequency as n becomes ...