Search Results for ""

Vince and Bóna (2012) define an assembly tree T for a connected simple graph G on n nodes as a binary rooted tree with n leavesTree Leaf and n-1 internal nodes and satisfying ...

Schur's partition theorem lets A(n) denote the number of partitions of n into parts congruent to +/-1 (mod 6), B(n) denote the number of partitions of n into distinct parts ...

The number of colors sufficient for map coloring on a surface of genus g is given by the Heawood conjecture, chi(g)=|_1/2(7+sqrt(48g+1))_|, where |_x_| is the floor function. ...

Scan the decimal expansion of a constant (including any digits to the left of the decimal point) until all n-digit strings have been seen (including 0-padded strings). The ...

If there is an integer 0<x<p such that x^2=q (mod p), (1) i.e., the congruence (1) has a solution, then q is said to be a quadratic residue (mod p). Note that the trivial ...

The operator I^~ which takes a real number to the same real number I^~r=r.

The number k in the expression s(n)=kn for a multiperfect number is called its class.

An even alternating permutation number, more commonly called a tangent number.

10^(18) bytes. Unfortunately, the term is sometimes also used to mean 2^(60)=1024^6 bytes. However, the latter usage is deprecated, and the term exbibyte is preferred for ...

1000 bytes. Unfortunately, the term is sometimes also used to mean 2^(10)=1024 bytes. However, this usage is deprecated, and the term kibibyte is preferred for 1024 bytes.