Search Results for ""

A transformation of period 2.

A lottery in which three numbers are picked at random from the integers 1-14.

The traveling salesman problem is a problem in graph theory requiring the most efficient (i.e., least total distance) Hamiltonian cycle a salesman can take through each of n ...

In the American system, 10^(42).

An integer n which is tested to see if it divides a given number.

A 13-sided polygon, sometimes also called the triskaidecagon.

The trilinear quotient of two points p:q:r and u:v:w is the point p/u:q/v:r/w.

Possessing a three equivalent modes.

A polynomial with three terms.

(x^2+axy+by^2)(t^2+atu+bu^2)=r^2+ars+bs^2, (1) where r = xt-byu (2) s = yt+xu+ayu. (3)