Search Results for ""

The Higman-Sims graph is the unique strongly regular graph on 100 nodes (Higman and Sims 1968, Brouwer 1983, Brouwer and Haemers 1993). It was also constructed independently ...

Let the center B of a circle of radius a move along a line BA. Let O be a fixed point located a distance c away from AB. Draw a secant line through O and D, the midpoint of ...

A public-key cryptography algorithm which uses prime factorization as the trapdoor one-way function. Define n=pq (1) for p and q primes. Also define a private key d and a ...

If at least one of d, e, or f has the form q^(-N) for some nonnegative integer N (in which case both sums terminate after N+1 terms), then ...

An almost integer is a number that is very close to an integer. Near-solutions to Fermat's last theorem provide a number of high-profile almost integers. In the season 7, ...

The 2-1 equation A^n+B^n=C^n (1) is a special case of Fermat's last theorem and so has no solutions for n>=3. Lander et al. (1967) give a table showing the smallest n for ...

The partial differential equation w_t-6(w+epsilon^2w^2)w_x+w_(xxx)=0, which can also be rewritten (w)_t+(-3w^2-2epsilon^2w^3+w_(xx))_x=0.

Construct a 5×5×5 cube from thirteen 1×2×4 blocks, one 2×2×2 block, one 1×2×2, and three 1×1×3 blocks.

The Schnirelmann density of a set of nonnegative integers is the greatest lower bound of the fractions A(n)/n where A(n) is the number of terms in the set <=n.

Assemble six 1×2×2 blocks and three 1×1×1 blocks into a 3×3×3 cube.