Search Results for ""

Fractran is an algorithm applied to a given list f_1, f_2, ..., f_k of fractions. Given a starting integer N, the FRACTRAN algorithm proceeds by repeatedly multiplying the ...

Gaussian brackets are notation published by Gauss in Disquisitiones Arithmeticae and defined by [ ]=1 (1) [a_1]=a_1 (2) [a_1,a_2]=[a_1]a_2+[ ] (3) ...

The algorithm of constructing and interpreting a quotient-difference table which allows interconversion of continued fractions, power series, and rational functions ...

Connectivity properties obey the following hierarchy: convex => star convex => pathwise-connected => connected.

A power series containing fractional exponents (Davenport et al. 1993, p. 91) and logarithms, where the logarithms may be multiply nested, e.g., lnlnx.

Pick any two relatively prime integers h and k, then the circle C(h,k) of radius 1/(2k^2) centered at (h/k,+/-1/(2k^2)) is known as a Ford circle. No matter what and how many ...

A special type of binary tree obtained by starting with the fractions 0/1 and 1/0 and iteratively inserting (m+m^')/(n+n^') between each two adjacent fractions m/n and ...

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 ...

Two fractions are said to be adjacent if their difference has a unit numerator. For example, 1/3 and 1/4 are adjacent since 1/3-1/4=1/12, but 1/2 and 1/5 are not since ...

Cahen's constant is defined as C = sum_(k=0)^(infty)((-1)^k)/(a_k-1) (1) = 0.64341054628... (2) (OEIS A118227), where a_k is the kth term of Sylvester's sequence.