Search Results for ""

Rényi's polynomial is the polynomial (Rényi 1947, Coppersmith and Davenport 1991) that has 29 terms and whose square has 28, making it a sparse polynomial square.

The simplest dissection of a square into rectangles of the same areas but different shapes, composed of the seven pieces illustrated above. The square is 210 units on a side, ...

Externally erect a square on the side BC. Now join the new vertices S_(AB) and S_AC of this square with the vertex A, marking the points of intersection Q_(A,BC) and ...

Let p be an odd prime and b a positive integer not divisible by p. Then for each positive odd integer 2k-1<p, let r_k be r_k=(2k-1)b (mod p) with 0<r_k<p, and let t be the ...

Let K be a number field and let O be an order in K. Then the set of equivalence classes of invertible fractional ideals of O forms a multiplicative Abelian group called the ...

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

For any algebraic number x of degree n>2, a rational approximation p/q to x must satisfy |x-p/q|>1/(q^n) for sufficiently large q. Writing r=n leads to the definition of the ...

Legion's number of the first kind is defined as L_1 = 666^(666) (1) = 27154..._()_(1871 digits)98016, (2) where 666 is the beast number. It has 1881 decimal digits. Legion's ...

An addition chain for a number n is a sequence 1=a_0<a_1<...<a_r=n, such that each member after a_0 is the sum of two earlier (not necessarily distinct) ones. The number r is ...