Search Results for ""
2591 - 2600 of 9369 for Fermat 4n Plus 1 TheoremSearch Results
Let there be n>=2 integers 0<a_1<...<a_n with GCD(a_1,a_2,...,a_n)=1. The values a_i represent the denominations of n different coins, where these denominations have greatest ...
Define a cell in R^1 as an open interval or a point. A cell in R^(k+1) then has one of two forms, {(x,y):x in C, and f(x)<y<g(x)} (1) or {(x,y):x in C, and y=f(x)}, (2) where ...
The definition of an Anosov map is the same as for an Anosov diffeomorphism except that instead of being a diffeomorphism, it is a map. In particular, an Anosov map is a C^1 ...
The Lambert W-function, also called the omega function, is the inverse function of f(W)=We^W. (1) The plot above shows the function along the real axis. The principal value ...
The q-analog of pi pi_q can be defined by setting a=0 in the q-factorial [a]_q!=1(1+q)(1+q+q^2)...(1+q+...+q^(a-1)) (1) to obtain ...
A tensor which has the same components in all rotated coordinate systems. All rank-0 tensors (scalars) are isotropic, but no rank-1 tensors (vectors) are. The unique rank-2 ...
Krall and Fink (1949) defined the Bessel polynomials as the function y_n(x) = sum_(k=0)^(n)((n+k)!)/((n-k)!k!)(x/2)^k (1) = sqrt(2/(pix))e^(1/x)K_(-n-1/2)(1/x), (2) where ...
The entire function B(z) = [(sin(piz))/pi]^2[2/z+sum_(n=0)^(infty)1/((z-n)^2)-sum_(n=1)^(infty)1/((z+n)^2)] (1) = 1-(2sin^2(piz))/(pi^2z^2)[z^2psi_1(z)-z-1], (2) where ...
A binary bracketing is a bracketing built up entirely of binary operations. The number of binary bracketings of n letters (Catalan's problem) are given by the Catalan numbers ...
The algebraic identity (sum_(i=1)^na_ic_i)(sum_(i=1)^nb_id_i)-(sum_(i=1)^na_id_i)(sum_(i=1)^nb_ic_i) =sum_(1<=i<j<=n)(a_ib_j-a_jb_i)(c_id_j-c_jd_i). (1) Letting c_i=a_i and ...
...
View search results from all Wolfram sites (505142 matches)

