Search Results for ""

The m-book graph is defined as the graph Cartesian product B_m=S_(m+1) square P_2, where S_m is a star graph and P_2 is the path graph on two nodes. The generalization of the ...

The stacked book graph of order (m,n) is defined as the graph Cartesian product S_(m+1) square P_n, where S_m is a star graph and P_n is the path graph on n nodes. It is ...

How far can a stack of n books protrude over the edge of a table without the stack falling over? It turns out that the maximum overhang possible d_n for n books (in terms of ...

The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for ...

An International Standard Book Number (ISBN) is a code used to uniquely identify a book together. It also uniquely encodes the book's publisher and includes information about ...

For any two integers a and b, suppose d|ab. Then if d is relatively prime to a, then d divides b. This results appeared in Euclid's Elements, Book VII, Proposition 30. This ...

The construction of polyhedra using identical building blocks. The illustrations above show such constructions for the cuboctahedron, octahedron rhombic dodecahedron, and ...

A regular two-dimensional arrangement of squares separated by vertical and horizontal "canals." Looking at the grid produces the illusion of gray spots in the white area ...

It is possible to describe a set of positive integers that cannot be listed in a book containing a set of counting numbers on each consecutively numbered page. Another form ...

In Kepler's 1619 book Harmonice Mundi on tilings, he discussed a tiling built with pentagons, pentagrams, decagons, and "fused decagon pairs." He also called them "monsters." ...