Search Results for ""

The negative integers ..., -3, -2, -1.

The positive integers 1, 2, 3, ..., equivalent to N.

The nonnegative integers 0, 1, 2, ....

The Higman-Sims graph is the unique strongly regular graph on 100 nodes (Higman and Sims 1968, Brouwer 1983, Brouwer and Haemers 1993). It was also constructed independently ...

A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].

The Szekeres snark was the fifth snark discovered, illustrated above. It has 50 vertices and edge chromatic number 4.

For every k>1, there exist only finite many pairs of powers (p,p^') with p and p^' natural numbers and k=p^'-p.

Let p be a prime with n digits and let A be a constant. Call p an "A-prime" if the concatenation of the first n digits of A (ignoring the decimal point if one is present) ...

Almost all natural numbers are very, very, very large (Steinbach 1990, p. 111).

A maximal sum-free set is a set {a_1,a_2,...,a_n} of distinct natural numbers such that a maximum l of them satisfy a_(i_j)+a_(i_k)!=a_m, for 1<=j<k<=l, 1<=m<=n.