Search Results for ""

Approximants derived by expanding a function as a ratio of two power series and determining both the numerator and denominator coefficients. Padé approximations are usually ...

Let p(d) be the probability that a random walk on a d-D lattice returns to the origin. In 1921, Pólya proved that p(1)=p(2)=1, (1) but p(d)<1 (2) for d>2. Watson (1939), ...

Circumscribe a triangle about a circle, another circle around the triangle, a square outside the circle, another circle outside the square, and so on. The circumradius and ...

A prime constellation of four successive primes with minimal distance (p,p+2,p+6,p+8). The term was coined by Paul Stäckel (1892-1919; Tietze 1965, p. 19). The quadruplet (2, ...

Quicksort is the fastest known comparison-based sorting algorithm (on average, and for a large number of elements), requiring O(nlgn) steps. Quicksort is a recursive ...

Given the closed interval [0,x] with x>1, let one-dimensional "cars" of unit length be parked randomly on the interval. The mean number M(x) of cars which can fit (without ...

The simple continued fraction representations of e given by [2; 1, 2, 1, 1, 4, 1, 1, 6, ...] (OEIS A003417). This continued fraction is sometimes known as Euler's continued ...

The number one (1), also called "unity," is the first positive integer. It is an odd number. Although the number 1 used to be considered a prime number, it requires special ...

Given a homogeneous linear second-order ordinary differential equation, y^('')+P(x)y^'+Q(x)y=0, (1) call the two linearly independent solutions y_1(x) and y_2(x). Then ...

Consider the process of taking a number, adding its digits, then adding the digits of the number derived from it, etc., until the remaining number has only one digit. The ...