Search Results for ""

n-dimensional Euclidean space.

Two integers are relatively prime if they share no common positive factors (divisors) except 1. Using the notation (m,n) to denote the greatest common divisor, two integers m ...

A partition is a way of writing an integer n as a sum of positive integers where the order of the addends is not significant, possibly subject to one or more additional ...

A forest is an acyclic graph (i.e., a graph without any graph cycles). Forests therefore consist only of (possibly disconnected) trees, hence the name "forest." Examples of ...

The m×n queen graph Q_(m,n) is a graph with mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a queen. ...

The M_(22) graph, also known as the 77-graph, is a strongly regular graph on 77 nodes related to the Mathieu group M_(22) and to the Witt design. It is illustrated above in ...

A solution to a problem that can be written in "closed form" in terms of known functions, constants, etc., is often called an analytic solution. Note that this use of the ...

An algorithm for computing an Egyptian fraction (Stewart 1992).

Brun's sieve was refined by J. B. Rosser, G. Ricci, and others.

The Cauchy product of two sequences f(n) and g(n) defined for nonnegative integers n is defined by (f degreesg)(n)=sum_(k=0)^nf(k)g(n-k).