Search Results for ""

The Kaprekar routine is an algorithm discovered in 1949 by D. R. Kaprekar for 4-digit numbers, but which can be generalized to k-digit numbers. To apply the Kaprekar routine ...

The Thue-Morse sequence, also called the Morse-Thue sequence or Prouhet-Thue-Morse sequence (Allouche and Cosnard 2000), is one of a number of related sequences of numbers ...

Ballantine's series is the series for pi given by pi=864sum_(n=0)^infty((n!)^24^n)/((2n+1)!325^(n+1)) +1824sum_(n=0)^infty((n!)^24^n)/((2n+1)!3250^(n+1))-20cot^(-1)239 ...

While some authors define "circumference" as distance around an arbitrary closed object (sometimes restricted to a closed curved object), in the work, the term "perimeter" is ...

The approximation for pi given by pi approx sqrt((40)/3-2sqrt(3)) (1) = 1/3sqrt(120-18sqrt(3)) (2) = 3.141533.... (3) In the above figure, let OA=OF=1, and construct the ...

Decimal is the base-10 notational system for representing real numbers. The expression of a number using the decimal system is called its decimal expansion, examples of which ...

Arrange copies of the n digits 1, ..., n such that there is one digit between the 1s, two digits between the 2s, etc. For example, the unique (modulo reversal) n=3 solution ...

The base 2 method of counting in which only the digits 0 and 1 are used. In this base, the number 1011 equals 1·2^0+1·2^1+0·2^2+1·2^3=11. This base is used in computers, ...

A limiting value of a holonomic function near a singular point. Holonomic constants include Apéry's constant, Catalan's constant, Pólya's random walk constants for d>2, and ...

Consider an n-digit number k. Square it and add the right n digits to the left n or n-1 digits. If the resultant sum is k, then k is called a Kaprekar number. For example, 9 ...