Abstract

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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call