Search Results for ""

The hundred-dollar, hundred-digits challenge problems are a set of ten problems in numerical analysis published in the January/February 2002 issue of SIAM News ...

The Earls sequence gives the starting position in the decimal digits of pi (or in general, any constant), not counting digits to the left of the decimal point, at which a ...

An unsolved problem in mathematics attributed to Lehmer (1933) that concerns the minimum Mahler measure M_1(P) for a univariate polynomial P(x) that is not a product of ...

Bowling, known as "ten pins" throughout most of the world, is a game played by rolling a heavy ball down a long narrow track and attempting to knock down ten pins arranged in ...

100=10^2. Madachy (1979) gives a number of algebraic equations using the digits 1 to 9 which evaluate to 100, such as (7-5)^2+96+8-4-3-1 = 100 (1) 3^2+91+7+8-6-5-4 = 100 (2) ...

The logarithm log_bx for a base b and a number x is defined to be the inverse function of taking b to the power x, i.e., b^x. Therefore, for any x and b, x=log_b(b^x), (1) or ...

A set of numbers obeying a pattern like the following: 91·37 = 3367 (1) 9901·3367 = 33336667 (2) 999001·333667 = 333333666667 (3) 99990001·33336667 = 3333333366666667 (4) 4^2 ...

Trigonometric identities which prove useful in the construction of map projections include (1) where A^' = A-C (2) B^' = 2B-4D (3) C^' = 4C (4) D^' = 8D. (5) ...

There are two definitions of the Carmichael function. One is the reduced totient function (also called the least universal exponent function), defined as the smallest integer ...

Consider the recurrence relation x_n=(1+x_0^2+x_1^2+...+x_(n-1)^2)/n, (1) with x_0=1. The first few iterates of x_n are 1, 2, 3, 5, 10, 28, 154, ... (OEIS A003504). The terms ...