Search Results for ""

A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. A vertex coloring that minimize ...

A Diophantine problem (i.e., one whose solution must be given in terms of integers) which seeks a solution to the following problem. Given n men and a pile of coconuts, each ...

The Monty Hall problem is named for its similarity to the Let's Make a Deal television game show hosted by Monty Hall. The problem is stated as follows. Assume that a room is ...

Consider the process of taking a number, multiplying its digits, then multiplying the digits of numbers derived from it, etc., until the remaining number has only one digit. ...

Multivariate zeta function, also called multiple zeta values, multivariate zeta constants (Bailey et al. 2006, p. 43), multi-zeta values (Bailey et al. 2006, p. 17), and ...

For 2<=n<=32, it is possible to select 2n lattice points with x,y in [1,n] such that no three are in a straight line (where "straight line" means any line in the plane--not ...

Given two starting numbers (a_1,a_2), the following table gives the unique sequences {a_i} that contain no three-term arithmetic progressions. Sloane sequence A003278 1, 2, ...

Given a function f(x) of a variable x tabulated at m values y_1=f(x_1), ..., y_m=f(x_m), assume the function is of known analytic form depending on n parameters ...

A normalized form of the cumulative normal distribution function giving the probability that a variate assumes a value in the range [0,x], ...

An extremely fast factorization method developed by Pollard which was used to factor the RSA-130 number. This method is the most powerful known for factoring general numbers, ...