Search Results for ""

A positive integer n is called a base-b Rhonda number if the product of the base-b digits of n is equal to b times the sum of n's prime factors. These numbers were named by ...

The Skewes number (or first Skewes number) is the number Sk_1 above which pi(n)<li(n) must fail (assuming that the Riemann hypothesis is true), where pi(n) is the prime ...

To pick a random point on the surface of a unit sphere, it is incorrect to select spherical coordinates theta and phi from uniform distributions theta in [0,2pi) and phi in ...

The stella octangula is a polyhedron compound composed of a tetrahedron and its dual (a second tetrahedron rotated 180 degrees with respect to the first). The stella ...

A statistical distribution published by William Gosset in 1908. His employer, Guinness Breweries, required him to publish under a pseudonym, so he chose "Student." Given N ...

There are two problems commonly known as the subset sum problem. The first ("given sum problem") is the problem of finding what subset of a list of integers has a given sum, ...

There are several differing definitions of the sun graph. ISGCI defines a (complete) n-sun graph as a graph on 2n nodes (sometimes also known as a trampoline graph; ...

The (m,n)-tadpole graph, also called a dragon graph (Truszczyński 1984) or kite graph (Kim and Park 2006), is the graph obtained by joining a cycle graph C_m to a path graph ...

Given a pick-7 lottery with 23 numbers that pays a prize to anyone matching at least 4 of the 7 numbers, there is a set of 253 tickets that guarantees a win. This set ...

Zarankiewicz's conjecture asserts that graph crossing number for a complete bipartite graph K_(m,n) is Z(m,n)=|_n/2_||_(n-1)/2_||_m/2_||_(m-1)/2_|, (1) where |_x_| is the ...