Search Results for ""

Arrange copies of the n digits 1, ..., n such that there is one digit between the 1s, two digits between the 2s, etc. For example, the unique (modulo reversal) n=3 solution ...

For an integer n>=2, let gpf(x) denote the greatest prime factor of n, i.e., the number p_k in the factorization n=p_1^(a_1)...p_k^(a_k), with p_i<p_j for i<j. For n=2, 3, ...

In combinatorial mathematics, the series-parallel networks problem asks for the number of networks that can be formed using a given number of edges. The edges can be ...

De Grey (2018) found the first examples of unit-distance graphs with chromatic number 5, thus demonstrating that the solution to the Hadwiger-Nelson problem (i.e., the ...

The number of empty neighbors of a cluster.

A Ramsey number of the form R(k,k;2).

A term for number theory.

The ordered pair (s,t), where s is the number of real embeddings of the number field and t is the number of complex-conjugate pairs of embeddings. The degree of the number ...

The algebraic integers in a number field.

The number p in a fraction p/q, i.e., the dividend.