- #1

diana.hole

- 8

- 0

## Homework Statement

I've encountered a problem in which i need help with to explain my answer:

problem: Steve puts matches of equal length end-to-end to create three sides of a triangle. He possesses an unlimited supply of matches and cannot split anyone of the matches in half, thirds etc. Steve made a right-angled triangle with a certain number of matches. He then used all those matches to make a different shaped right-angled triangle. What is the smallest number of matches Steve could have used?

2. Homework Equations

i used pythagoras' theorem and the formula used to find out the pythag. triples (a=n^2- m^2, b=2nm, c=n^2+ m^2, where n is larger than m)

## The Attempt at a Solution

ive found an answer but I am not quite sure whether it's the correct answer. my answer was 60 as the minimum. I am also not quite sure how to justify my answer or explain the process i went through. also, the three sides of both triangles created are considered to be pythag. triples, but they couldn't be acquired through the pythag. triples rule.