Search Results for ""

Pythagoras's constant sqrt(2) has decimal expansion sqrt(2)=1.4142135623... (OEIS A000129), It was computed to 2000000000050 decimal digits by A. J. Yee on Feb. 9, 2012. The ...

A figurate number of the form P_n^((4))=1/6n(n+1)(2n+1), (1) corresponding to a configuration of points which form a square pyramid, is called a square pyramidal number (or ...

Szemerédi's theorem states that every sequence of integers that has positive upper Banach density contains arbitrarily long arithmetic progressions. A corollary states that, ...

Theodorus's constant sqrt(3) has decimal expansion sqrt(3)=1.732050807... (OEIS A002194). It was computed to 10^(10) decimal digits by E. Weisstein on Jul. 23, 2013. The ...

The Thue-Morse constant, also called the parity constant, is given by the concatenated digits of the Thue-Morse sequence P=0.0110100110010110100101100..._2 (1) (OEIS A010060) ...

Wavelets are a class of a functions used to localize a given function in both space and scaling. A family of wavelets can be constructed from a function psi(x), sometimes ...

A cellular automaton is a collection of "colored" cells on a grid of specified shape that evolves through a number of discrete time steps according to a set of rules based on ...

The greatest common divisor, sometimes also called the highest common divisor (Hardy and Wright 1979, p. 20), of two positive integers a and b is the largest divisor common ...

The divisor function sigma_k(n) for n an integer is defined as the sum of the kth powers of the (positive integer) divisors of n, sigma_k(n)=sum_(d|n)d^k. (1) It is ...

An abundant number, sometimes also called an excessive number, is a positive integer n for which s(n)=sigma(n)-n>n, (1) where sigma(n) is the divisor function and s(n) is the ...