Search Results for ""

A semimagic square is a square that fails to be a magic square only because one or both of the main diagonal sums do not equal the magic constant (Kraitchik 1942, p. 143). ...

Regular tessellations of the plane by two or more convex regular polygons such that the same polygons in the same order surround each polygon vertex are called semiregular ...

The Sendov conjecture, proposed by Blagovest Sendov circa 1958, that for a polynomial f(z)=(z-r_1)(z-r_2)...(z-r_n) with n>=2 and each root r_k located inside the closed unit ...

A sentence is a logic formula in which every variable is quantified. The concept of a sentence is important because formulas with variables that are not quantified are ...

A separating family is a set of subsets in which each pair of adjacent elements are found separated, each in one of two disjoint subsets. The 26 letters of the alphabet can ...

A septic graph is a regular graph of degree seven. The numbers of (not necessarily connected) simple septic graphs on n=8, 10, 12, ... vertices are 1, 5, 1547, 21609301, ...

A connected graph having e graph edges is said to be sequential if it is possible to label the nodes i with distinct integers f_i in {0,1,2,...,e-1} such that when graph edge ...

A class is a generalized set invented to get around Russell's antinomy while retaining the arbitrary criteria for membership which leads to difficulty for sets. The members ...

A sextic graph is a regular graph of degree six. The numbers of simple sextic graphs on n=7, 8, ... nodes are 1, 1, 4, 21, 266, 7846, 367860, ... (OEIS A006822). Examples are ...

Let p(n) be the first prime which follows a prime gap of n between consecutive primes. Shanks' conjecture holds that p(n)∼exp(sqrt(n)). Wolf conjectures a slightly different ...