On the Set of Primitive Triples of Natural Numbers Satisfying the Diophantine Equation of Pythagor

The main task considered in the article is to find the condition primitive integer solutions of the Diophantine Pithagorean equation x2+y2=z2 It is known that for this purpose it is enough to find primive solution of x, y such that x is even and y is odd. In this paper, in particular, we proved that the z of a primitive solution is a Prime number of the form 4k+1. It is prove in this paper that any right triangle with integer side lengths has a hypotenuse equal to a Prime of the form 4k+1and we show with the help of the descent axiom how to find primitive solutions of x and y in this case. We divide the search for primitive solutions (x, y, z) of right triangles into two cases: 1) the hypotenuse of such triangles is a Prime number of the form 4k+1 and 2) the hypotenuse of such triangles is a composite number. In section 3 we use formulas known to the ancient Hindus to find primitive solutions of Pithagorean equations in cases where m and n

ReadCiteExport

Add to List

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Sign up to Zendy

Having issues? You can contact us here