Search Results for ""

A Euclidean number is a number which can be obtained by repeatedly solving the quadratic equation. Euclidean numbers, together with the rational numbers, can be constructed ...

For |z|<1, product_(k=1)^infty(1+z^k)=product_(k=1)^infty(1-z^(2k-1))^(-1). (1) Both of these have closed form representation 1/2(-1;z)_infty, (2) where (a;q)_infty is a ...

The extended mean-value theorem (Anton 1984, pp. 543-544), also known as the Cauchy mean-value theorem (Anton 1984, pp. 543) and Cauchy's mean-value formula (Apostol 1967, p. ...

A extension ring (or ring extension) of a ring R is any ring S of which R is a subring. For example, the field of rational numbers Q and the ring of Gaussian integers Z[i] ...

If a function f(x) is continuous on a closed interval [a,b], then f(x) has both a maximum and a minimum on [a,b]. If f(x) has an extremum on an open interval (a,b), then the ...

An extremum is a maximum or minimum. An extremum may be local (a.k.a. a relative extremum; an extremum in a given region which is not the overall maximum or minimum) or ...

Euler (1738, 1753) considered the series s_a(x)=sum_(n=1)^infty[1/(1-a^n)product_(k=0)^(n-1)(1-xa^(-k))]. He showed that just like log_a(a^n)=n, s_a(a^n)=n for nonnegative ...

The Fibonacci factorial constant is the constant appearing in the asymptotic growth of the fibonorials (aka. Fibonacci factorials) n!_F. It is given by the infinite product ...

Let M^n be an n-manifold and let F={F_alpha} denote a partition of M^n into disjoint pathwise-connected subsets. Then F is called a foliation of M^n of codimension c (with ...

Let (Omega)_(ij) be the resistance distance matrix of a connected graph G on n nodes. Then Foster's theorems state that sum_((i,j) in E(G)))Omega_(ij)=n-1, where E(g) is the ...