**conjectured** — index assumed (inferred), presumptive, putative Burton s Legal Thesaurus. William C. Burton. 2006 … Law dictionary

**conjectured** — conÂ·jecÂ·ture || kÉ™n dÊ’ektÊƒÉ™ n. guess, supposition, assumption v. hypothesize, guess, surmise, infer, speculate … English contemporary dictionary

**Prime number** — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… … Wikipedia

**Polignac's conjecture** — In number theory, Polignac s conjecture was made by Alphonse de Polignac in 1849 and states: For any positive even number n, there are infinitely many prime gaps of size n. In other words: There are infinitely many cases of two consecutive prime… … Wikipedia

**mathematics** — /math euh mat iks/, n. 1. (used with a sing. v.) the systematic treatment of magnitude, relationships between figures and forms, and relations between quantities expressed symbolically. 2. (used with a sing. or pl. v.) mathematical procedures,… … Universalium

**Circle packing in a circle** — is a two dimensional packing problem with the objective of packing unit circles into the smallest possible larger circle. Minimum solutions:[1] Number of unit circles Enclosing circle radius Density Optimality Diagram 1 1 1.0000 Trivially optimal … Wikipedia

**Waring's problem** — In number theory, Waring s problem, proposed in 1770 by Edward Waring, asks whether for every natural number k there exists an associated positive integer s such that every natural number is the sum of at most s k th powers of natural numbers… … Wikipedia

**Analytic number theory** — In mathematics, analytic number theory is a branch of number theory that uses methods from mathematical analysis to solve number theoretical problems. [Page 7 of Apostol 1976] It is often said to have begun with Dirichlet s introduction of… … Wikipedia

**Edge coloring** — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia

**Mandelbrot set** — Initial image of a Mandelbrot set zoom sequence with a continuously coloured environment … Wikipedia