Search Results for ""

The maximum number of regions that can be created by n cuts using space division by planes, cube division by planes, cylinder cutting, etc., is given by N_(max)=1/6(n^3+5n+6) ...

The successive square method is an algorithm to compute a^b in a finite field GF(p). The first step is to decompose b in successive powers of two, b=sum_(i)delta_i2^i, (1) ...

A biquadratic number is a fourth power, n^4. The first few biquadratic numbers are 1, 16, 81, 256, 625, ... (OEIS A000583). The minimum number of biquadratic numbers needed ...

A number which can be specified implicitly or explicitly by exponential, logarithmic, and algebraic operations.

An unhappy number is a number that is not happy, i.e., a number n such that iterating this sum-of-squared-digits map starting with n never reaches the number 1. The first few ...

Johnson solid J_(45).

The mean square displacement (MSD) of a set of N displacements x_n is given by <|x|^2>=sum_(k=1)^N|x_k|^2. It arises particularly in Brownian motion and random walk problems. ...

In the illusion illustrated above, when the concentric square borders with rounded edges are rotated slowly, the entire pattern appears to pulsate radially.

Johnson solid J_(85).

A polynomial which is not necessarily an invariant of a link. It is related to the dichroic polynomial. It is defined by the skein relationship ...