Search Results for ""

The only whole number solution to the Diophantine equation y^3=x^2+2 is y=3, x=+/-5. This theorem was offered as a problem by Fermat, who suppressed his own proof.

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...

A smooth curve which corresponds to the limiting case of a histogram computed for a frequency distribution of a continuous distribution as the number of data points becomes ...

The infimum of all number a for which |f(z)|<=exp(|z|^a) holds for all |z|>r and f an entire function, is called the order of f, denoted lambda=lambda(f) (Krantz 1999, p. ...

The Goffinet dragon is the fractal obtained by plotting all points spanned by powers of the complex number p=0.65-0.3i (Trott 2004, p. 9).

The greatest dividing exponent gde(n,b) of a base b with respect to a number n is the largest integer value of k such that b^k|n, where b^k<=n. It is implemented as the ...

The set of sums sum_(x)a_xx ranging over a multiplicative group and a_i are elements of a field with all but a finite number of a_i=0. Group rings are graded algebras.

The largest unit fraction, 1/2. 1/2 is a rational number with terminating decimal expansion 0.5.

The smallest nontrivial taxicab number, i.e., the smallest number representable in two ways as a sum of two cubes. It is given by 1729=1^3+12^3=9^3+10^3. The number derives ...

How many times can a shape be completely surrounded by copies of itself without being able to tile the entire plane, i.e., what is the maximum (finite) Heesch number?