scholarly journals Pythagorean Triples with Common Sides

2019 ◽  
Vol 2019 ◽  
pp. 1-8
Author(s):  
Raymond Calvin Ochieng ◽  
Chiteng’a John Chikunji ◽  
Vitalis Onyango-Otieno
Keyword(s):  
Finite Number ◽  
Pythagorean Triples ◽  
Pythagorean Triple

There exist a finite number of Pythagorean triples that have a common leg. In this paper we derive the formulas that generate pairs of primitive Pythagorean triples with common legs and also show the process of how to determine all the primitive and nonprimitive Pythagorean triples for a given leg of a Pythagorean triple.

THE SHUFFLE VARIANT OF JEŚMANOWICZ’ CONJECTURE CONCERNING PYTHAGOREAN TRIPLES

2011 ◽  
Vol 90 (3) ◽  
pp. 355-370
Author(s):  
TAKAFUMI MIYAZAKI
Keyword(s):  
Unique Solution ◽  
Pythagorean Triples ◽  
Pythagorean Triple ◽  
Positive Integers

AbstractLet (a,b,c) be a primitive Pythagorean triple such that b is even. In 1956, Jeśmanowicz conjectured that the equation ax+by=cz has the unique solution (x,y,z)=(2,2,2) in the positive integers. This is one of the most famous unsolved problems on Pythagorean triples. In this paper we propose a similar problem (which we call the shuffle variant of Jeśmanowicz’ problem). Our problem states that the equation cx+by=az with x,y and z positive integers has the unique solution (x,y,z)=(1,1,2) if c=b+1 and has no solutions if c>b+1 . We prove that the shuffle variant of the Jeśmanowicz problem is true if c≡1 mod b.

SOME NOTES ON A GENERALIZED VERSION OF PYTHAGOREAN TRIPLES

2020 ◽  
Vol 4 (2) ◽  
pp. 103
Author(s):  
Leomarich F Casinillo ◽  
Emily L Casinillo
Keyword(s):  
Diophantine Equation ◽  
Pythagorean Triples ◽  
Pythagorean Triple ◽  
Positive Integers

A Pythagorean triple is a set of three positive integers a, b and c that satisfy the Diophantine equation a^2+b^2=c^2. The triple is said to be primitive if gcd(a, b, c)=1 and each pair of integers and  are relatively prime, otherwise known as non-primitive. In this paper, the generalized version of the formula that generates primitive and non-primitive Pythagorean triples that depends on two positive integers  k and n, that is, P_T=(a(k, n), b(k, n), c(k, n)) were constructed. Further, we determined the values of  k and n that generates primitive Pythagorean triples and give some important results.

scholarly journals A note on Jeśmanowicz’ conjecture for non-primitive Pythagorean triples

2021 ◽  
Vol 5 (1) ◽  
pp. 115-127
Author(s):  
Van Thien Nguyen ◽  
◽  
Viet Kh. Nguyen ◽  
Pham Hung Quy ◽  
◽  
...  
Keyword(s):  
Positive Integer ◽  
Simple Proof ◽  
Diophantine Equation ◽  
Necessary Conditions ◽  
Integer Solution ◽  
Positive Integer Solution ◽  
Pythagorean Triples ◽  
Pythagorean Triple

Let \((a, b, c)\) be a primitive Pythagorean triple parameterized as \(a=u^2-v^2, b=2uv, c=u^2+v^2\), where \(u>v>0\) are co-prime and not of the same parity. In 1956, L. Jesmanowicz conjectured that for any positive integer \(n\), the Diophantine equation \((an)^x+(bn)^y=(cn)^z\) has only the positive integer solution \((x,y,z)=(2,2,2)\). In this connection we call a positive integer solution \((x,y,z)\ne (2,2,2)\) with \(n>1\) exceptional. In 1999 M.-H. Le gave necessary conditions for the existence of exceptional solutions which were refined recently by H. Yang and R.-Q. Fu. In this paper we give a unified simple proof of the theorem of Le-Yang-Fu. Next we give necessary conditions for the existence of exceptional solutions in the case \(v=2,\ u\) is an odd prime. As an application we show the truth of the Jesmanowicz conjecture for all prime values \(u < 100\).

A Matrix Method for Generating Pythagorean Triples

1987 ◽  
Vol 80 (2) ◽  
pp. 103-108
Author(s):  
Phyllis Lefton
Keyword(s):  
Matrix Method ◽  
Greatest Common Divisor ◽  
Pythagorean Triples ◽  
Pythagorean Triple

This article describes a program that uses an interesting matrix method to generate Pythagorean triples -that is, solutions of the equation a2 + b2 = c2 for which a, b, and c are integers. Only primitive triples are found, that is, those for which a > 0, b > 0, c > 0, and the greatest common divisor of a, b, and c is one. This result suffices because nonprimitive triples are just multiples of primitive ones. We shall use the abbreviation PPT for primitive Pythagorean triple.

A NOTE ON JEŚMANOWICZ’ CONJECTURE CONCERNING PRIMITIVE PYTHAGOREAN TRIPLES

2016 ◽  
Vol 95 (1) ◽  
pp. 5-13 ◽  
Author(s):  
MOU-JIE DENG ◽  
DONG-MING HUANG
Keyword(s):  
Positive Integer ◽  
Diophantine Equation ◽  
Integer Solution ◽  
Character Theory ◽  
Positive Integer Solution ◽  
Pythagorean Triples ◽  
Pythagorean Triple ◽  
Positive Integers ◽  
Baker's Theorem

Let $a,b,c$ be a primitive Pythagorean triple and set $a=m^{2}-n^{2},b=2mn,c=m^{2}+n^{2}$, where $m$ and $n$ are positive integers with $m>n$, $\text{gcd}(m,n)=1$ and $m\not \equiv n~(\text{mod}~2)$. In 1956, Jeśmanowicz conjectured that the only positive integer solution to the Diophantine equation $(m^{2}-n^{2})^{x}+(2mn)^{y}=(m^{2}+n^{2})^{z}$ is $(x,y,z)=(2,2,2)$. We use biquadratic character theory to investigate the case with $(m,n)\equiv (2,3)~(\text{mod}~4)$. We show that Jeśmanowicz’ conjecture is true in this case if $m+n\not \equiv 1~(\text{mod}~16)$ or $y>1$. Finally, using these results together with Laurent’s refinement of Baker’s theorem, we show that Jeśmanowicz’ conjecture is true if $(m,n)\equiv (2,3)~(\text{mod}~4)$ and $n<100$.

A group of Pythagorean triples using the inradius

2021 ◽  
Vol 105 (563) ◽  
pp. 209-215
Author(s):  
Howard Sporn
Keyword(s):  
Pythagorean Triples ◽  
Pythagorean Triple

Pythagorean triples are triples of integers (a, b, c) satisfying the equation a2 + b2 = c2. For the purpose of this paper, we will take a, b and c to be positive, unless otherwise stated. Then, of course, it follows that a triple represents the lengths of sides of a right triangle. Also, for the purpose of this paper, we will consider the triples (a, b, c) and (b, a, c) to be distinct, even though they represent the same right triangle. A primitive Pythagorean triple is one for which a, b and c are relatively prime.

scholarly journals Groups and monoids of Pythagorean triples connected to conics

2017 ◽  
Vol 15 (1) ◽  
pp. 1323-1331
Author(s):  
Nadir Murru ◽  
Marco Abrate ◽  
Stefano Barbero ◽  
Umberto Cerruti
Keyword(s):  
Commutative Monoid ◽  
Commutative Monoids ◽  
Pythagorean Triples ◽  
Pythagorean Triple

Abstract We define operations that give the set of all Pythagorean triples a structure of commutative monoid. In particular, we define these operations by using injections between integer triples and 3 × 3 matrices. Firstly, we completely characterize these injections that yield commutative monoids of integer triples. Secondly, we determine commutative monoids of Pythagorean triples characterizing some Pythagorean triple preserving matrices. Moreover, this study offers unexpectedly an original connection with groups over conics. Using this connection, we determine groups composed by Pythagorean triples with the studied operations.

scholarly journals Formally Proving the Boolean Pythagorean Triples Conjecture

10.29007/jvdj ◽  
2018 ◽  
Author(s):  
Luís Cruz-Filipe ◽  
Peter Schneider-Kamp
Keyword(s):  
Natural Number ◽  
Mathematical Problem ◽  
Propositional Formula ◽  
Natural Numbers ◽  
Original Proof ◽  
Pythagorean Triples ◽  
Mathematical Argument ◽  
Pythagorean Triple ◽  
The Relationship

In 2016, Heule, Kullmann and Marek solved the Boolean Pythagorean Triples problem: is there a binary coloring of the natural numbers such that every Pythagorean triple contains an element of each color? By encoding a finite portion of this problem as a propositional formula and showing its unsatisfiability, they established that such a coloring does not exist. Subsequently, this answer was verified by a correct-by-construction checker extracted from a Coq formalization, which was able to reproduce the original proof. However, none of these works address the question of formally addressing the relationship between the propositional formula that was constructed and the mathematical problem being considered. In this work, we formalize the Boolean Pythagorean Triples problem in Coq. We recursively define a family of propositional formulas, parameterized on a natural number n, and show that unsatisfiability of this formula for any particular n implies that there does not exist a solution to the problem. We then formalize the mathematical argument behind the simplification step in the original proof of unsatisfiability and the logical argument underlying cube-and-conquer, obtaining a verified proof of Heule et al.’s solution.

scholarly journals A note on Jeśmanowicz' conjecture concerning Pythagorean triples

1999 ◽  
Vol 59 (3) ◽  
pp. 477-480 ◽  
Author(s):  
Maohua Le
Keyword(s):  
Positive Integer ◽  
Pythagorean Triples ◽  
Pythagorean Triple ◽  
Integer Solutions

Let n be a positive integer, and let (a, b, c) be a primitive Pythagorean triple. In this paper we give certain conditions for the equation (an)x + (bn)y = (cn)z to have positive integer solutions (x, y, z) with (x, y, z) ≠ (2, 2, 2). In particular, we show that x, y and z must be distinct.

Sign in / Sign up

Export Citation Format

Share Document