Search Results for ""

An antimagic graph is a graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex differ.

A sequence of moves (i.e., a path) on a chessboard by a chess piece in which each square of a chessboard is visited exactly once.

There are many mathematical and recreational problems related to folding. Origami, the Japanese art of paper folding, is one well-known example. It is possible to make a ...

Discrete Mathematics

With n cuts of a torus of genus 1, the maximum number of pieces which can be obtained is N(n)=1/6(n^3+3n^2+8n). The first few terms are 2, 6, 13, 24, 40, 62, 91, 128, 174, ...

The gnomon was an L-shaped movable sundial used for astronomical studies. It operated by resting on one leg so that the other pointed vertically upward. By measuring the ...

A hex number, also called a centered hexagonal number, is given by H_n = 1+6T_n (1) = 3n^2+3n+1, (2) where T_n=n(n+1)/2 is the nth triangular number and the indexing with ...

In 1704, Sebastien Truchet considered all possible patterns formed by tilings of right triangles oriented at the four corners of a square (Wolfram 2002, p. 875). Truchet's ...

Sudoku (literally, "single number"), sometimes also is a pencil-and-paper logic puzzle whose goal is to complete a grid satisfying various constraints. In the "classic" ...

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 ...