Search Results for ""

There are many formulas of pi of many types. Among others, these include series, products, geometric constructions, limits, special values, and pi iterations. pi is ...

A problem posed by L. Collatz in 1937, also called the 3x+1 mapping, 3n+1 problem, Hasse's algorithm, Kakutani's problem, Syracuse algorithm, Syracuse problem, Thwaites ...

Goldbach's original conjecture (sometimes called the "ternary" Goldbach conjecture), written in a June 7, 1742 letter to Euler, states "at least it seems that every number ...

An automorphism of a graph is a graph isomorphism with itself, i.e., a mapping from the vertices of the given graph G back to vertices of G such that the resulting graph is ...

A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through a graph that visits each node ...

A prime gap of length n is a run of n-1 consecutive composite numbers between two successive primes. Therefore, the difference between two successive primes p_k and p_(k+1) ...

A 4-cusped hypocycloid which is sometimes also called a tetracuspid, cubocycloid, or paracycle. The parametric equations of the astroid can be obtained by plugging in n=a/b=4 ...

A branch cut is a curve (with ends possibly open, closed, or half-open) in the complex plane across which an analytic multivalued function is discontinuous. For convenience, ...

Clean tile is a game investigated by Buffon (1777) in which players bet on the number of different tiles a thrown coin will partially cover on a floor that is regularly ...

The complex numbers are the field C of numbers of the form x+iy, where x and y are real numbers and i is the imaginary unit equal to the square root of -1, sqrt(-1). When a ...