Search Results for ""

This is sometimes knows as the "bars and stars" method. Suppose a recipe called for 5 pinches of spice, out of 9 spices. Each possibility is an arrangement of 5 spices ...

The second-order ordinary differential equation (1-x^2)y^('')-2(mu+1)xy^'+(nu-mu)(nu+mu+1)y=0 (1) sometimes called the hyperspherical differential equation (Iyanaga and ...

A quantitative measure of the simplicity of a geometric construction which reduces geometric constructions to five steps. It was devised by È. Lemoine. S_1 Place a ...

Geometry is the study of figures in a space of a given number of dimensions and of a given type. The most common types of geometry are plane geometry (dealing with objects ...

Go is played on a 19×19 grid, with pieces being placed at the intersections of grid lines, rather than in the middle of them. Go boards have a number of peculiarities, ...

A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...

The smallest possible number of vertices a polyhedral nonhamiltonian graph can have is 11, and there exist 74 such graphs. The Goldner-Harary graph (Goldner and Harary 1975a, ...

The simple continued fraction of the Golomb-Dickman constant lambda is [0; 1, 1, 1, 1, 1, 22, 1, 2, 3, 1, 1, 11, ...] (OEIS A225336). Note that this continued fraction ...

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 ...

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 ...