Search Results for ""

Determining the maximum number of pieces in which it is possible to divide a circle for a given number of cuts is called the circle cutting or pancake cutting problem. The ...

A Smith number is a composite number the sum of whose digits is the sum of the digits of its prime factors (excluding 1). (The primes are excluded since they trivially ...

If r is a root of a nonzero polynomial equation a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, (1) where the a_is are integers (or equivalently, rational numbers) and r satisfies no ...

The average number of regions into which n randomly chosen planes divide a cube is N^_(n)=1/(324)(2n+23)n(n-1)pi+n+1 (Finch 2003, p. 482). The maximum number of regions is ...

A Colbert number is any prime number with more than 1000000 decimal digits whose discovery contributes to the long-sought after proof that k=78557 is the smallest Sierpiński ...

The triangular number T_n is a figurate number that can be represented in the form of a triangular grid of points where the first row contains a single element and each ...

Given an integer sequence {a_n}_(n=1)^infty, a prime number p is said to be a primitive prime factor of the term a_n if p divides a_n but does not divide any a_m for m<n. It ...

Also called "Ethiopian multiplication." To multiply two numbers a and b, write a_0=a and b_0=b in two columns. Under a_0, write |_a_0/2_|, where |_x_| is the floor function, ...

A rational number is a number that can be expressed as a fraction p/q where p and q are integers and q!=0. A rational number p/q is said to have numerator p and denominator ...

A Stoneham number is a number alpha_(b,c) of the form alpha_(b,c)=sum_(k=1)^infty1/(b^(c^k)c^k), where b,c>1 are relatively prime positive integers. Stoneham (1973) proved ...