Search Results for ""

Logic is the formal mathematical study of the methods, structure, and validity of mathematical deduction and proof. According to Wolfram (2002, p. 860), logic is the most ...

The integer sequence beginning with a single digit in which the next term is obtained by describing the previous term. Starting with 1, the sequence would be defined by "1, ...

A Lucas cube graph of order n is a graph that can be defined based on the n-Fibonacci cube graph by forbidding vertex strings that have a 1 both in the first and last ...

A magic cube is an n×n×n version of a magic square in which the n^2 rows, n^2 columns, n^2 pillars, and four space diagonals each sum to a single number M_3(n) known as the ...

A magic hexagon of order n is an arrangement of close-packed hexagons containing the numbers 1, 2, ..., H_(n-1), where H_n is the nth hex number such that the numbers along ...

Let a chess piece make a tour on an n×n chessboard whose squares are numbered from 1 to n^2 along the path of the chess piece. Then the tour is called a magic tour if the ...

The Mangoldt function is the function defined by Lambda(n)={lnp if n=p^k for p a prime; 0 otherwise, (1) sometimes also called the lambda function. exp(Lambda(n)) has the ...

Also called the ménage problem. In how many ways can n married couples be seated around a circular table in such a manner than there is always one man between two women and ...

Mastermind is a simple two-player code-breaking board game invented in 1970 by Mordecai Meirowitz, an Israeli postmaster and telecommunications expert. It may have been ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings in ...