Search Results for ""

The Mertens function is the summary function M(n)=sum_(k=1)^nmu(k), (1) where mu(n) is the Möbius function (Mertens 1897; Havil 2003, p. 208). The first few values are 1, 0, ...

A number n is k-multiperfect (also called a k-multiply perfect number or k-pluperfect number) if sigma(n)=kn for some integer k>2, where sigma(n) is the divisor function. The ...

In three dimensions, there are three classes of constant curvature geometries. All are based on the first four of Euclid's postulates, but each uses its own version of the ...

Nonstandard analysis is a branch of mathematical logic which introduces hyperreal numbers to allow for the existence of "genuine infinitesimals," which are numbers that are ...

The integer sequence defined by the recurrence P(n)=P(n-2)+P(n-3) (1) with the initial conditions P(0)=3, P(1)=0, P(2)=2. This recurrence relation is the same as that for the ...

A short mnemonic for remembering the first seven decimal digits of pi is "How I wish I could calculate pi" (C. Heckman, pers. comm., Feb. 3, 2005). Eight digits are given by ...

A plane partition is a two-dimensional array of integers n_(i,j) that are nonincreasing both from left to right and top to bottom and that add up to a given number n. In ...

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

Probability is the branch of mathematics that studies the possible outcomes of given events together with the outcomes' relative likelihoods and distributions. In common ...

A positive integer n is called a base-b Rhonda number if the product of the base-b digits of n is equal to b times the sum of n's prime factors. These numbers were named by ...