When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Collatz conjecture - Wikipedia

    en.wikipedia.org/wiki/Collatz_conjecture

    The Collatz conjecture [a] ... Then the formula for the map is exactly the same as when the domain is the integers: an 'even' such rational is divided by 2; an 'odd ...

  3. Gauss circle problem - Wikipedia

    en.wikipedia.org/wiki/Gauss_circle_problem

    Gauss's circle problem asks how many points there are inside this circle of the form (,) where and are both integers. Since the equation of this circle is given in Cartesian coordinates by x 2 + y 2 = r 2 {\displaystyle x^{2}+y^{2}=r^{2}} , the question is equivalently asking how many pairs of integers m and n there are such that

  4. Lothar Collatz - Wikipedia

    en.wikipedia.org/wiki/Lothar_Collatz

    Lothar Collatz (German:; July 6, 1910 – September 26, 1990) was a German mathematician, born in Arnsberg, Westphalia. The "3x + 1" problem is also known as the Collatz conjecture, named after him and still unsolved. The Collatz–Wielandt formula for the Perron–Frobenius eigenvalue of a positive square matrix was also named after him.

  5. List of conjectures - Wikipedia

    en.wikipedia.org/wiki/List_of_conjectures

    Conjecture Field Comments Eponym(s) Cites 1/3–2/3 conjecture: order theory: n/a: 70 abc conjecture: number theory: ⇔Granville–Langevin conjecture, Vojta's conjecture in dimension 1 ⇒Erdős–Woods conjecture, Fermat–Catalan conjecture Formulated by David Masser and Joseph Oesterlé. [1] Proof claimed in 2012 by Shinichi Mochizuki: n/a ...

  6. List of unsolved problems in mathematics - Wikipedia

    en.wikipedia.org/wiki/List_of_unsolved_problems...

    Cereceda's conjecture on the diameter of the space of colorings of degenerate graphs [87] The Earth–Moon problem: what is the maximum chromatic number of biplanar graphs? [88] The Erdős–Faber–Lovász conjecture on coloring unions of cliques [89] The graceful tree conjecture that every tree admits a graceful labeling

  7. Conjecture - Wikipedia

    en.wikipedia.org/wiki/Conjecture

    For instance, the Collatz conjecture, which concerns whether or not certain sequences of integers terminate, has been tested for all integers up to 1.2 × 10 12 (1.2 trillion). However, the failure to find a counterexample after extensive search does not constitute a proof that the conjecture is true—because the conjecture might be false but ...

  8. Circle packing - Wikipedia

    en.wikipedia.org/wiki/Circle_packing

    The most efficient way to pack different-sized circles together is not obvious. In geometry, circle packing is the study of the arrangement of circles (of equal or varying sizes) on a given surface such that no overlapping occurs and so that no circle can be enlarged without creating an overlap.

  9. Circle - Wikipedia

    en.wikipedia.org/wiki/Circle

    Given a chord of length y and with sagitta of length x, since the sagitta intersects the midpoint of the chord, we know that it is a part of a diameter of the circle. Since the diameter is twice the radius, the "missing" part of the diameter is (2r − x) in length.