When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Pythagorean triple - Wikipedia

    en.wikipedia.org/wiki/Pythagorean_triple

    More generally, a positive integer c is the hypotenuse of a primitive Pythagorean triple if and only if each prime factor of c is congruent to 1 modulo 4; that is, each prime factor has the form 4n + 1. In this case, the number of primitive Pythagorean triples (a, b, c) with a < b is 2 k−1, where k is the number of distinct prime factors of c ...

  3. Tree of primitive Pythagorean triples - Wikipedia

    en.wikipedia.org/wiki/Tree_of_primitive...

    A tree of primitive Pythagorean triples is a mathematical tree in which each node represents a primitive Pythagorean triple and each primitive Pythagorean triple is represented by exactly one node. In two of these trees, Berggren's tree and Price's tree, the root of the tree is the triple (3,4,5), and each node has exactly three children ...

  4. File:PrimitivePythagoreanTriplesRev08.svg - Wikipedia

    en.wikipedia.org/wiki/File:PrimitivePythagorean...

    English: A depiction of all the primitive Pythagorean triples (a,b,c) with a and b < 1170 and a odd, where a is plotted on the horizontal axis, b on the vertical. The curvilinear grid is composed of curves of constant m − n and of constant m + n in Euclid's formula, a = m 2 − n 2 , b = 2 m n {\displaystyle a=m^{2}-n^{2},b=2mn} .

  5. Formulas for generating Pythagorean triples - Wikipedia

    en.wikipedia.org/wiki/Formulas_for_generating...

    Wade and Wade [17] first introduced the categorization of Pythagorean triples by their height, defined as c − b, linking 3,4,5 to 5,12,13 and 7,24,25 and so on. McCullough and Wade [18] extended this approach, which produces all Pythagorean triples when k > h √ 2 /d: Write a positive integer h as pq 2 with p square-free and q positive.

  6. Integer triangle - Wikipedia

    en.wikipedia.org/wiki/Integer_triangle

    A Pythagorean triangle is right-angled and Heronian. Its three integer sides are known as a Pythagorean triple or Pythagorean triplet or Pythagorean triad. [9] All Pythagorean triples (,,) with hypotenuse which are primitive (the sides having no common factor) can be generated by

  7. Plimpton 322 - Wikipedia

    en.wikipedia.org/wiki/Plimpton_322

    The triple is primitive, that is the three triangle sides have no common factor, if p and q are coprime and not both odd. Neugebauer and Sachs propose the tablet was generated by choosing p and q to be coprime regular numbers (but both may be odd—see Row 15) and computing d = p 2 + q 2 , s = p 2 − q 2 , and l = 2 pq (so that l is also a ...

  8. Pythagorean Triangles - Wikipedia

    en.wikipedia.org/wiki/Pythagorean_Triangles

    [4] [6] The first three of these define the primitive Pythagorean triples (the ones in which the two sides and hypotenuse have no common factor), derive the standard formula for generating all primitive Pythagorean triples, compute the inradius of Pythagorean triangles, and construct all triangles with sides of length at most 100. [6]

  9. Pell number - Wikipedia

    en.wikipedia.org/wiki/Pell_number

    If a right triangle has integer side lengths a, b, c (necessarily satisfying the Pythagorean theorem a 2 + b 2 = c 2), then (a,b,c) is known as a Pythagorean triple. As Martin (1875) describes, the Pell numbers can be used to form Pythagorean triples in which a and b are one unit apart, corresponding to right triangles that are nearly isosceles ...