Search Results for ""

A diagonal matrix is a square matrix A of the form a_(ij)=c_idelta_(ij), (1) where delta_(ij) is the Kronecker delta, c_i are constants, and i,j=1, 2, ..., n, with no implied ...

Given an arithmetic progression of terms an+b, for n=1, 2, ..., the series contains an infinite number of primes if a and b are relatively prime, i.e., (a,b)=1. This result ...

A series which is not convergent. Series may diverge by marching off to infinity or by oscillating. Divergent series have some curious properties. For example, rearranging ...

The Fibonacci number F_(n+1) gives the number of ways for 2×1 dominoes to cover a 2×n checkerboard, as illustrated in the diagrams above (Dickau). The numbers of domino ...

Dots and boxes is a two-person game based on a rectangular lattice of points. Each player, in turn, draws a horizontal or vertical line connecting two adjacent points. ...

A simple way to describe a knot projection. The advantage of this notation is that it enables a knot diagram to be drawn quickly. For an oriented alternating knot with n ...

Milnor (1956) found more than one smooth structure on the seven-dimensional hypersphere. Generalizations have subsequently been found in other dimensions. Using surgery ...

Given a Poisson distribution with rate of change lambda, the distribution of waiting times between successive changes (with k=0) is D(x) = P(X<=x) (1) = 1-P(X>x) (2) = ...

In general, an extremal graph is the largest graph of order n which does not contain a given graph G as a subgraph (Skiena 1990, p. 143). Turán studied extremal graphs that ...

Fermat's 4n+1 theorem, sometimes called Fermat's two-square theorem or simply "Fermat's theorem," states that a prime number p can be represented in an essentially unique ...