Search Results for ""

In the early 1950s, Ernst Straus asked 1. Is every region illuminable from every point in the region? 2. Is every region illuminable from at least one point in the region? ...

The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which ...

Find the minimum size square capable of bounding n equal squares arranged in any configuration. The first few cases are illustrated above (Friedman). The only packings which ...

An addition chain for a number n is a sequence 1=a_0<a_1<...<a_r=n, such that each member after a_0 is the sum of two earlier (not necessarily distinct) ones. The number r is ...

The portion of number theory concerned with expressing an integer as a sum of integers from some given set.

A pair of numbers m and n such that sigma(m)=sigma(n)=m+n-1, where sigma(m) is the divisor function. Beck and Najar (1977) found 11 augmented amicable pairs.

A polyiamond consisting of equilateral triangles arranged along a line.

The nth coefficient in the power series of a univalent function should be no greater than n. In other words, if f(z)=a_0+a_1z+a_2z^2+...+a_nz^n+... is a conformal mapping of ...

The number of single operations (of addition, subtraction, and multiplication) required to complete an algorithm.

A (symmetrical) boundary set of radius r and center x_0 is the set of all points x such that |x-x_0|=r. Let x_0 be the origin. In R^1, the boundary set is then the pair of ...