How do you find a primitive pythagorean triangle that has a hypotenuse of 29?
or
How do you determine that and ?
guess and check man, fortunately you only gotta check the things less than the square root of 841. I honestly do not know a better way to do it.
You could probably limit some of the possibilities by considering residues mod 10. Like to get a 1 for the ones place you know you are going to need something that will be 0+1, or 2+9, or 3+8 or 4+7 or 5+6, then figure out which integers squared give you those things and check those. Like I think nothing squared gives a ones digit of 2, 3, 7, or 8. So I think the only possible ways of ending in a 1 would be a 0+1 or a 5+6. So you need to look at the things ending in 0 and 1 (like ) or things when squared end in 5 and 6 (like , and then )
but honestly I think it would be quicker to just get out a calculator and start cranking them out, especially because we were lucky that it ended in 1.
Well then I suggest you do my suggestion above and consider reduction mod 10 is probably the easiest. Also it may be of use to you to know that every Pythagorean Triple is generated as follows.
Let with .
Then is a Pythagorean Triple. Of course this method takes a while and yields lots of non primitive ones. I suggest memorizing the squares of integers up to 20 or 25 before the exam, it could save you a lot of time. Take your c^2 and subtract some squares from it and see if you recognize it as a perfect square, that is how I did it when you sent me the question the first time.
Sorry to repeat a post, I accidentally put this on your other thread about pythag. triples when I meant to put it here, but really it fits in both places I guess.