Search Results for ""

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

A derangement is a permutation in which none of the objects appear in their "natural" (i.e., ordered) place. For example, the only derangements of {1,2,3} are {2,3,1} and ...

The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...

Given a Poisson process, the probability of obtaining exactly n successes in N trials is given by the limit of a binomial distribution P_p(n|N)=(N!)/(n!(N-n)!)p^n(1-p)^(N-n). ...

A p-adic number is an extension of the field of rationals such that congruences modulo powers of a fixed prime p are related to proximity in the so called "p-adic metric." ...

A Pascal's triangle written in a square grid and padded with zeros, as written by Jakob Bernoulli (Smith 1984). The figurate number triangle therefore has entries a_(ij)=(i; ...

Power formulas include sin^2x = 1/2[1-cos(2x)] (1) sin^3x = 1/4[3sinx-sin(3x)] (2) sin^4x = 1/8[3-4cos(2x)+cos(4x)] (3) and cos^2x = 1/2[1+cos(2x)] (4) cos^3x = ...

Convergents of the pi continued fractions are the simplest approximants to pi. The first few are given by 3, 22/7, 333/106, 355/113, 103993/33102, 104348/33215, ... (OEIS ...

A prime factor is a factor that is prime, i.e., one that cannot itself be factored. In general, a prime factorization takes the form ...

A prime link is a link that cannot be represented as a knot sum of other links. Doll and Hoste (1991) list polynomials for oriented links of nine or fewer crossings, and ...