Search Results for ""

The Fermat number F_n is prime iff 3^(2^(2^n-1))=-1 (mod F_n).

Subtraction is the operation of taking the difference d=x-y of two numbers x and y. Here, x is called the minuend, y is called the subtrahend, and the symbol between the x ...

The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may ...

A Brauer chain is an addition chain in which each member uses the previous member as an addend. A number n for which a shortest chain exists which is a Brauer chain is called ...

A multiple of a number x is any quantity y=nx with n an integer. If x and y are integers, then x is called a factor of y. The smallest positive number m for which there exist ...

A quadratic map is a quadratic recurrence equation of the form x_(n+1)=a_2x_n^2+a_1x_n+a_0. (1) While some quadratic maps are solvable in closed form (for example, the three ...

A bivariate polynomial is a polynomial in two variables. Bivariate polynomials have the form f(x,y)=sum_(i,j)a_(i,j)x^iy^j. A homogeneous bivariate polynomial, also called a ...

A relation is any subset of a Cartesian product. For instance, a subset of A×B, called a "binary relation from A to B," is a collection of ordered pairs (a,b) with first ...

A test which always identifies prime numbers correctly, but may incorrectly identify a composite number as a prime.

One of the Plücker characteristics, defined by p=1/2(n-1)(n-2)-(delta+kappa)=1/2(m-1)(m-2)-(tau+iota), where m is the class, n the order, delta the number of nodes, kappa the ...