Search Results for ""

The Möbius-Kantor graph is the unique cubic symmetric graph on 16 nodes, illustrated above in several embeddings. Its unique canonical LCF notation is [5,-5]^8. The ...

The Möbius function is a number theoretic function defined by mu(n)={0 if n has one or more repeated prime factors; 1 if n=1; (-1)^k if n is a product of k distinct primes, ...

The Möbius strip, also called the twisted cylinder (Henle 1994, p. 110), is a one-sided nonorientable surface obtained by cutting a closed band into a single strip, giving ...

Multiply all the digits of a number n by each other, repeating with the product until a single digit is obtained. The number of steps required is known as the multiplicative ...

The Newton-Cotes formulas are an extremely useful and straightforward family of numerical integration techniques. To integrate a function f(x) over some interval [a,b], ...

A normal distribution in a variate X with mean mu and variance sigma^2 is a statistic distribution with probability density function ...

The Pappus graph is a cubic symmetric distance-regular graph on 18 vertices, illustrated above in three embeddings. It is Hamiltonian and can be represented in LCF notation ...

Perfect numbers are positive integers n such that n=s(n), (1) where s(n) is the restricted divisor function (i.e., the sum of proper divisors of n), or equivalently ...

A Pisot number is a positive algebraic integer greater than 1 all of whose conjugate elements have absolute value less than 1. A real quadratic algebraic integer greater than ...

A graph is planar if it can be drawn in a plane without graph edges crossing (i.e., it has graph crossing number 0). The number of planar graphs with n=1, 2, ... nodes are 1, ...