Search Results for ""
1621 - 1630 of 1656 for Fibonacci SequenceSearch Results
A function tau(n) related to the divisor function sigma_k(n), also sometimes called Ramanujan's tau function. It is defined via the Fourier series of the modular discriminant ...
A transcendental number is a (possibly complex) number that is not the root of any integer polynomial, meaning that it is not an algebraic number of any degree. Every real ...
A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...
In his Meditationes algebraicae, Waring (1770, 1782) proposed a generalization of Lagrange's four-square theorem, stating that every rational integer is the sum of a fixed ...
The xi-function is the function xi(z) = 1/2z(z-1)(Gamma(1/2z))/(pi^(z/2))zeta(z) (1) = ((z-1)Gamma(1/2z+1)zeta(z))/(sqrt(pi^z)), (2) where zeta(z) is the Riemann zeta ...
The j-function is the modular function defined by j(tau)=1728J(tau), (1) where tau is the half-period ratio, I[tau]>0, ...
The constant pi, denoted pi, is a real number defined as the ratio of a circle's circumference C to its diameter d=2r, pi = C/d (1) = C/(2r) (2) pi has decimal expansion ...
An amicable pair (m,n) consists of two integers m,n for which the sum of proper divisors (the divisors excluding the number itself) of one number equals the other. Amicable ...
Apéry's constant is defined by zeta(3)=1.2020569..., (1) (OEIS A002117) where zeta(z) is the Riemann zeta function. Apéry (1979) proved that zeta(3) is irrational, although ...
The important binomial theorem states that sum_(k=0)^n(n; k)r^k=(1+r)^n. (1) Consider sums of powers of binomial coefficients a_n^((r)) = sum_(k=0)^(n)(n; k)^r (2) = ...
...
View search results from all Wolfram sites (12619 matches)

