Search Results for ""

Count the number of lattice points N(r) inside the boundary of a circle of radius r with center at the origin. The exact solution is given by the sum N(r) = ...

1. A fixed polyomino. 2. The set of points obtained by taking the centers of a fixed polyomino.

The 4-polyhex illustrated above (Gardner 1978, p. 147).

A polyhex consisting of hexagons arranged along a line.

A polyiamond consisting of equilateral triangles arranged along a line.

The 4-polyhex illustrated above.

For every positive integer n, there exists a square in the plane with exactly n lattice points in its interior. This was extended by Schinzel and Kulikowski to all plane ...

The 6-polyiamond illustrated above.

The 6-polyiamond illustrated above.

A partition p is said to contain another partition q if the Ferrers diagram of p contains the Ferrers diagram of q. For example, {3,3,2} (left figure) contains both {3,3,1} ...