Search Results for ""

A problem is an exercise whose solution is desired. Mathematical "problems" may therefore range from simple puzzles to examination and contest problems to propositions whose ...

The Smarandache function mu(n) is the function first considered by Lucas (1883), Neuberg (1887), and Kempner (1918) and subsequently rediscovered by Smarandache (1980) that ...

666 is the occult "number of the beast," also called the "sign of the devil" (Wang 1994), associated in the Bible with the Antichrist. It has figured in many numerological ...

The number of ways a set of n elements can be partitioned into nonempty subsets is called a Bell number and is denoted B_n (not to be confused with the Bernoulli number, ...

Scan the decimal expansion of a constant (including any digits to the left of the decimal point) until all n-digit strings have been seen (including 0-padded strings). The ...

A Dirichlet L-series is a series of the form L_k(s,chi)=sum_(n=1)^inftychi_k(n)n^(-s), (1) where the number theoretic character chi_k(n) is an integer function with period k, ...

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

A sequence whose terms are integers. The most complete printed references for such sequences are Sloane (1973) and its update, Sloane and Plouffe (1995). Neil Sloane ...

A Keith number is an n-digit integer N>9 such that if a Fibonacci-like sequence (in which each term in the sequence is the sum of the n previous terms) is formed with the ...

Multiply all the digits of a number n by each other, repeating with the product until a single digit is obtained. The number of steps required is known as the multiplicative ...