Simon Singh gave the name Belphegor’s Prime to the number 1000000000000066600000000000001

One naive way to measure sparsity of a graph is to measure the length of its shortest cycle (recall that a cycle is a path which starts and ends at the same vertex)

The first of several addends, or “the one to which the others are added,” is sometimes called the augend.

[[Fn+1 Fn] [Fn Fn-1]] = [[1 1][1 0]]^n