Search Results for ""

1729 is sometimes called the Hardy-Ramanujan number. It is the smallest taxicab number, i.e., the smallest number which can be expressed as the sum of two cubes in two ...

The line R[s]=1/2 in the complex plane on which the Riemann hypothesis asserts that all nontrivial (complex) Riemann zeta function zeros lie. The plot above shows the first ...

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...

If a is an arbitrary integer relatively prime to n and g is a primitive root of n, then there exists among the numbers 0, 1, 2, ..., phi(n)-1, where phi(n) is the totient ...

The Floyd-Warshall algorithm, also variously known as Floyd's algorithm, the Roy-Floyd algorithm, the Roy-Warshall algorithm, or the WFI algorithm, is an algorithm for ...

Guilloché patterns are spirograph-like curves that frame a curve within an inner and outer envelope curve. They are used on banknotes, securities, and passports worldwide for ...

A (general, asymmetric) lens is a lamina formed by the intersection of two offset disks of unequal radii such that the intersection is not empty, one disk does not completely ...

A problem in game theory first discussed by A. Tucker. Suppose each of two prisoners A and B, who are not allowed to communicate with each other, is offered to be set free if ...

There are two definitions of the supersingular primes: one group-theoretic, and the other number-theoretic. Group-theoretically, let Gamma_0(N) be the modular group Gamma0, ...

A fast boat is overtaking a slower one when fog suddenly sets in. At this point, the boat being pursued changes course, but not speed, and proceeds straight in a new ...