Search Results for ""

sum_(k=0)^(infty)[((m)_k)/(k!)]^3 = 1+(m/1)^3+[(m(m+1))/(1·2)]^3+... (1) = (Gamma(1-3/2m))/([Gamma(1-1/2m)]^3)cos(1/2mpi), (2) where (m)_k is a Pochhammer symbol and Gamma(z) ...

It is possible to construct simple functions which produce growing patterns. For example, the Baxter-Hickerson function f(n)=1/3(2·10^(5n)-10^(4n)+2·10^(3n)+10^(2n)+10^n+1) ...

A triangle center is regular iff there is a triangle center function which is a polynomial in Delta, a, b, and c (where Delta is the area of the triangle) such that the ...

Let alpha, -beta, and -gamma^(-1) be the roots of the cubic equation t^3+2t^2-t-1=0, (1) then the Rogers L-function satisfies L(alpha)-L(alpha^2) = 1/7 (2) ...

An equation is said to be a closed-form solution if it solves a given problem in terms of functions and mathematical operations from a given generally-accepted set. For ...

Feynman (1997, p. 116) noticed the curious fact that the decimal expansion 1/(243)=0.004115226337448559... (1) repeats pairs of the digits 0, 1, 2, 3, ... separated by the ...

Every irrational number x has an approximation constant c(x) defined by c(x)=lim inf_(q->infty)q|qx-p|, where p=nint(qx) is the nearest integer to qx and lim inf is the ...

Calabi's triangle is the unique triangle other that the equilateral triangle for which the largest inscribed square can be inscribed in three different ways (Calabi 1997). ...

A prime factorization algorithm which uses residues produced in the continued fraction of sqrt(mN) for some suitably chosen m to obtain a square number. The algorithm solves ...

The constant lambda=1.303577269034296... (OEIS A014715) giving the asymptotic rate of growth Clambda^n of the number of digits in the nth term of the look and say sequence, ...