Question

The table of exercise 1 suggests that one of the numbers in any primitive Pythagorean triple...

The table of exercise 1 suggests that one of the numbers in any primitive Pythagorean triple is divisible by 4, one is divisible by 3 and one is divisible by 5. Please Prove this

Homework Answers

Answer #1

Please keep in mind that the numbers in all primitive Pythagorean triple are not necessarily that one is divisible by 4, one is divisible by 3 and one is divisible by 5.

Here is an example that shows the argument is not correct for all  primitive Pythagorean triple

(5, 12, 13), (8, 15, 17), (7, 24, 25), (20, 21, 29), (12, 35, 37), (9, 40, 41)

These all are primitive Pythagorean triple but see in first on two numbers are divisible by 4 and 5 respectively but the last one is not divisible by 3.

Similarly in a second primitive Pythagorean triple two numbers are divisible by 4 and 3 respectively but the last one is not divisible by 5. And so on

So the above argument is not valid for the general cases.

Ask if you have any quarries. Thank you

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Prove: If (a,b,c) is a primitive Pythagorean triple, then either a or b is divisible by...
Prove: If (a,b,c) is a primitive Pythagorean triple, then either a or b is divisible by 3.
prove that in any primitive pythagorean triple (a,b,c), abc is a multiple of 30
prove that in any primitive pythagorean triple (a,b,c), abc is a multiple of 30
Find all Pythagorean triples (not necessarily primitive) in which 25 is one of the numbers and...
Find all Pythagorean triples (not necessarily primitive) in which 25 is one of the numbers and then prove that the list is complete.
In class we proved that if (x, y, z) is a primitive Pythagorean triple, then (switching...
In class we proved that if (x, y, z) is a primitive Pythagorean triple, then (switching x and y if necessary) it must be that (x, y, z) = (m2 − n 2 , 2mn, m2 + n 2 ) for some positive integers m and n satisfying m > n, gcd(m, n) = 1, and either m or n is even. In this question you will prove that the converse is true: if m and n are integers satisfying...
Prove: Let (a,b,c) be a primitive pythagorean triple. then we have the following 1. gcd(c-b, c+b)...
Prove: Let (a,b,c) be a primitive pythagorean triple. then we have the following 1. gcd(c-b, c+b) =1 2. c-b and c+b are squares
(a) Prove that if y = 4k for k ≥ 1, then there exists a primitive...
(a) Prove that if y = 4k for k ≥ 1, then there exists a primitive Pythagorean triple (x, y, z) containing y. (b) Prove that if x = 2k+1 is any odd positive integer greater than 1, then there exists a primitive Pythagorean triple (x, y, z) containing x. (c) Find primitive Pythagorean triples (x, y, z) for each of z = 25, 65, 85. Then show that there is no primitive Pythagorean triple (x, y, z) with z...
Prove: If (a, a+1, a+2) is a Pythagorean triple, then a= 3
Prove: If (a, a+1, a+2) is a Pythagorean triple, then a= 3
Let a, b, c be natural numbers. We say that (a, b, c) is a Pythagorean...
Let a, b, c be natural numbers. We say that (a, b, c) is a Pythagorean triple, if a2 + b2 = c2 . For example, (3, 4, 5) is a Pythagorean triple. For the next exercises, assume that (a, b, c) is a Pythagorean triple. (c) Prove that 4|ab Hint: use the previous result, and a proof by con- tradiction. (d) Prove that 3|ab. Hint: use a proof by contradiction. (e) Prove that 12 |ab. Hint : Use the...
Please answer the following in FULL detail! Is there a Pythagorean triple consisting of three Fibonacci...
Please answer the following in FULL detail! Is there a Pythagorean triple consisting of three Fibonacci numbers? Give an example if there is one, or a proof if there isn't.
(a) Use modular arithmetic to show that if an integer a is not divisible by 3,...
(a) Use modular arithmetic to show that if an integer a is not divisible by 3, then a 2 ≡ 1 (mod 3). (b) Use this result to prove that in any Pythagorean triple (x, y, z), either x or y (or both) must be divisible by 3