Search Results for ""

Let p be an odd prime and b a positive integer not divisible by p. Then for each positive odd integer 2k-1<p, let r_k be r_k=(2k-1)b (mod p) with 0<r_k<p, and let t be the ...

An odd alternating permutation number, more commonly called an Euler number or secant number.

A method for constructing magic squares of odd order, also called the Siamese method.

For p an odd prime and a positive integer a which is not a multiple of p, a^((p-1)/2)=(a/p) (mod p), where (a|p) is the Legendre symbol.

A Latin square is said to be odd if it contains an odd number of rows and columns that are odd permutations. Otherwise, it is said to be even. Let the number of even Latin ...

The twin composites may be defined by analogy with the twin primes as pairs of composite numbers (n,n+2). Since all even number are trivially twin composites, it is natural ...

A univariate function f(x) is said to be even provided that f(x)=f(-x). Geometrically, such functions are symmetric about the y-axis. Examples of even functions include 1 ...

A Berge graph is a simple graph that contains no odd graph hole and no odd graph antihole. The strong perfect graph theorem asserts that a graph is perfect iff it is a Berge ...

Dissect a triangle into smaller triangles, such that all have full edge contact with their neighbors. Label the corners 1, 2, and 3. Label all vertices with 1, 2, or 3, with ...

Consecutive numbers (or more properly, consecutive integers) are integers n_1 and n_2 such that n_2-n_1=1, i.e., n_2 follows immediately after n_1. Given two consecutive ...