Search Results for ""

Landau's problems are the four "unattackable" problems mentioned by Landau in the 1912 Fifth Congress of Mathematicians in Cambridge, namely: 1. The Goldbach conjecture, 2. ...

In the mice problem, also called the beetle problem, n mice start at the corners of a regular n-gon of unit side length, each heading towards its closest neighboring mouse in ...

The irrational constant R = e^(pisqrt(163)) (1) = 262537412640768743.9999999999992500... (2) (OEIS A060295), which is very close to an integer. Numbers such as the Ramanujan ...

The Schröder number S_n is the number of lattice paths in the Cartesian plane that start at (0, 0), end at (n,n), contain no points above the line y=x, and are composed only ...

The score sequence of a tournament is a monotonic nondecreasing sequence of the outdegrees of the graph vertices of the corresponding tournament graph. Elements of a score ...

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

By analogy with the sinc function, define the tanc function by tanc(z)={(tanz)/z for z!=0; 1 for z=0. (1) Since tanz/z is not a cardinal function, the "analogy" with the sinc ...

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. The most common type of vertex ...

The simple continued fraction representations of e given by [2; 1, 2, 1, 1, 4, 1, 1, 6, ...] (OEIS A003417). This continued fraction is sometimes known as Euler's continued ...

The Fields Medals are commonly regarded as mathematics' closest analog to the Nobel Prize (which does not exist in mathematics), and are awarded every four years by the ...