Search Results for ""

Let rho(x)dx be the fraction of time a typical dynamical map orbit spends in the interval [x,x+dx], and let rho(x) be normalized such that int_0^inftyrho(x)dx=1 over the ...

If proofreader A finds a mistakes and proofreader B finds b mistakes, c of which were also found by A, how many mistakes were missed by both A and B? Assume there are a total ...

A rational amicable pair consists of two integers a and b for which the divisor functions are equal and are of the form sigma(a)=sigma(b)=(P(a,b))/(Q(a,b))=R(a,b), (1) where ...

A unit fraction is a fraction with numerator 1. Examples of unit fractions include 1/2, 1/3, 1/12, and 1/123456. The famous Rhind papyrus, dated to around 1650 BC, discusses ...

A number n is called a barrier of a number-theoretic function f(m) if, for all m<n, m+f(m)<=n. Neither the totient function phi(n) nor the divisor function sigma(n) has a ...

An algorithm which allows digits of a given number to be calculated without requiring the computation of earlier digits. The BBP formula for pi is the best-known such ...

A number with a continued fraction whose terms are the values of one or more polynomials evaluated on consecutive integers and then interleaved. This property is preserved by ...

An archaic unit fraction variously defined as 1/200 (of an hour), 1/10 or 1/12 (of an inch), 1/12 (of a celestial body's angular diameter), or 1/60 (of an hour or degree).

J_n(x)=1/piint_0^picos(ntheta-xsintheta)dtheta, where J_n(x) is a Bessel function of the first kind.

If m is an integer, then for every residue class r (mod m), there are infinitely many nonnegative integers n for which P(n)=r (mod m), where P(n) is the partition function P.