Search Results for ""

Let all of the functions f_n(z)=sum_(k=0)^inftya_k^((n))(z-z_0)^k (1) with n=0, 1, 2, ..., be regular at least for |z-z_0|<r, and let F(z) = sum_(n=0)^(infty)f_n(z) (2) = (3) ...

Let K be a finite complex, and let phi:C_p(K)->C_p(K) be a chain map, then sum_(p)(-1)^pTr(phi,C_p(K))=sum_(p)(-1)^pTr(phi_*,H_p(K)/T_p(K)).

Each point in the convex hull of a set S in R^n is in the convex combination of n+1 or fewer points of S.

The inverse curve of the lituus is an Archimedean spiral with m=2, which is Fermat's spiral.

A prime p for which 1/p has a maximal period decimal expansion of p-1 digits. Full reptend primes are sometimes also called long primes (Conway and Guy 1996, pp. 157-163 and ...

Let (L,<=) be any complete lattice. Suppose f:L->L is monotone increasing (or isotone), i.e., for all x,y in L, x<=y implies f(x)<=f(y). Then the set of all fixed points of f ...

_2F_1(a,b;c;1)=((c-b)_(-a))/((c)_(-a))=(Gamma(c)Gamma(c-a-b))/(Gamma(c-a)Gamma(c-b)) for R[c-a-b]>0, where _2F_1(a,b;c;x) is a (Gauss) hypergeometric function. If a is a ...

For any integers a_i with 1<=a_1<a_2<...<a_k<=n, the proportion of permutations in the symmetric group S_n whose cyclic decompositions contain no cycles of lengths a_1, a_2, ...

Rather surprisingly, trigonometric functions of npi/17 for n an integer can be expressed in terms of sums, products, and finite root extractions because 17 is a Fermat prime. ...

A pseudoprime is a composite number that passes a test or sequence of tests that fail for most composite numbers. Unfortunately, some authors drop the "composite" ...