Search Results for ""

A pair of primes (p,q) that sum to an even integer 2n=p+q are known as a Goldbach partition (Oliveira e Silva). Letting r(2n) denote the number of Goldbach partitions of 2n ...

A sequence {a_n}_(n=1)^N forms a (binary) heap if it satisfies a_(|_j/2_|)<=a_j for 2<=j<=N, where |_x_| is the floor function, which is equivalent to a_i<a_(2i) and ...

Every position of every impartial game has a nim-value, making it equivalent to a nim-heap. To find the nim-value (also called the Sprague-Grundy number), take the mex of the ...

For a finite group G, let p(G) be the subgroup generated by all the Sylow p-subgroups of G. If X is a projective curve in characteristic p>0, and if x_0, ..., x_t are points ...

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...

The Griewank function is a function widely used to test the convergence of optimization functions. The Griewank function of order n is defined by ...

Rule 30 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

A repunit prime is a repunit (i.e., a number consisting of copies of the single digit 1) that is also a prime number. The base-10 repunit (possibly probable) primes ...

A k×n Latin rectangle is a k×n matrix with elements a_(ij) in {1,2,...,n} such that entries in each row and column are distinct. If k=n, the special case of a Latin square ...

A homework problem proposed in Steffi's math class in January 2003 asked students to prove that no ratio of two unequal numbers obtained by permuting all the digits 1, 2, ...