Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A teacher wants a list of every primitive Pythagorean triple whose hypotenuse is less than . Use the formula: count the pairs with , and of opposite parity, and . Organise the count by the value of . Give the number of triples and the largest hypotenuse below .
Every primitive triple is , , with coprime and of opposite parity. A triple with leg comes from a factor pair
with both factors of the same parity.
Check an answer or open a hint to unlock the worked solution.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Given. Pairs , coprime, opposite parity, .
Step 1. By .
Step 2. Add. .
Step 3. The largest hypotenuse. The largest below is , from , : the triple .
Check. Each pair gives a different primitive triple, because the formula is one to one.
Answer: primitive triples, the largest hypotenuse being .
Log in to join the discussion.
Loading…