Search Results for ""

Gomoku, also called go-moku (Japanese for "five points") is a tic-tac-toe-like game in which two players alternately place pieces, with each player using pieces of a fixed ...

Regardless of where one white and one black square are deleted from an ordinary 8×8 chessboard, the reduced board can always be covered exactly with 31 dominoes (of dimension ...

G = int_0^infty(e^(-u))/(1+u)du (1) = -eEi(-1) (2) = 0.596347362... (3) (OEIS A073003), where Ei(x) is the exponential integral. Stieltjes showed it has the continued ...

The function defined by y=ab^(q^x). It is used in actuarial science for specifying a simplified mortality law (Kenney and Keeping 1962, p. 241). Using s(x) as the probability ...

The gonality (also called divisorial gonality) gon(G) of a (finite) graph G is the minimum degree of a rank 1 divisor on that graph. It can be thought of as the minimum ...

A binomial coefficient (N; k) with k>=2 is called good if its least prime factor satisfies lpf(N; k)>k (Erdős et al. 1993). This is equivalent to the requirement that GCD((N; ...

A prime p_n is called "good" if p_n^2>p_(n-i)p_(n+i) for all 1<=i<=n-1 (there is a typo in Guy 1994 in which the is are replaced by 1s). There are infinitely many good ...

The second blackboard problem in the 1997 film Good Will Hunting asks for all the series-reduced trees (referred to by the alternate term "homeomorphically irreducible trees" ...

A two-coloring of a complete graph K_n of n nodes which contains exactly the number of monochromatic forced triangles and no more (i.e., a minimum of R+B where R and B are ...

Given a hereditary representation of a number n in base b, let B[b](n) be the nonnegative integer which results if we syntactically replace each b by b+1 (i.e., B[b] is a ...