Search Results for ""

The monster group is the highest order sporadic group M. It has group order |M| = (1) = (2) where the divisors are precisely the 15 supersingular primes (Ogg 1980). The ...

In order to recover all Fourier components of a periodic waveform, it is necessary to use a sampling rate nu at least twice the highest waveform frequency. The Nyquist ...

A multimagic square such that the first, second, third, fourth, and fifth powers of the elements all yield magic squares is known as a pentamagic square. The first known ...

A formula of first-order logic is in prenex normal form if it is of the form Q_1x_1...Q_nx_nM, (1) where each Q_i is a quantifier forall ("for all") or exists ("exists") and ...

The Fibonacci cube graph of order n is a graph on F_(n+2) vertices, where F_n is a Fibonacci number, labeled by the Zeckendorf representations of the numbers 0 to F_(n+2)-1 ...

A finite field is a field with a finite field order (i.e., number of elements), also called a Galois field. The order of a finite field is always a prime or a power of a ...

A bimagic cube is a (normal) magic cube that remains magic when all its elements are squared. Of course, even a normal magic cubic becomes nonnormal (i.e., contains ...

A copositive matrix is a real n×n square matrix A=(a_(ij)) that makes the corresponding quadratic form f(x)=x^(T)Ax nonnegative for all nonnegative n-vectors x. Copositive ...

Let X be a set of urelements that contains the set N of natural numbers, and let V(X) be a superstructure whose individuals are in X. Let V(^*X) be an enlargement of V(X), ...

A very general theorem that allows the number of discrete combinatorial objects of a given type to be enumerated (counted) as a function of their "order." The most common ...