Look at the first few Pythagorean triples: ( 3 , 4 , 5 ) , ( 5 , 1 2 , 1 3 ) , ( 7 , 2 4 , 2 5 ) , ( 9 , 4 0 , 4 1 ) , ( 1 1 , 6 0 , 6 1 ) . Can you spot the pattern here?
Let's assume N is equal to 2 7 , or 7 tetrated to 2 . Also, let ( a , b , c ) deonte the N th Pythagorean triple.
What is a + b + c ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
See my most recent post about Pythagorean Triples for the solution and the rule to the pattern. We have a = 1 6 4 7 0 8 7 , b = 1 3 5 6 4 4 7 7 9 2 7 8 4 , c = 1 3 5 6 4 4 7 7 9 2 7 8 5 .
What... HOW IS THIS ONLY LEVEL 2?? Can somenoe pls make it Level 3?
How do you define the 'nth' Pythagorean triple? (8,15,17) or (20,21,29) are Pythagorean Triples,too.
Log in to reply
The Nth Pythagorean triple ACCORDING TO THE PATTERN. 8, 15, 17 is not part of the pattern. You may want to look at my most recent post if you want to clarify what the pattern does.
The sequence of triples you outline appear to be those with shortest side of length 2 N + 1 for positive integers N , in which case the general formula for the desired sum is ( 2 N + 1 ) ( 2 N + 2 ) .
Problem Loading...
Note Loading...
Set Loading...
Another simple way to generate this pattern is to take any odd number as a , then find a 2 and split it as evenly as possible into whole numbers b and c . For example:
etc. As the last two numbers are consecutive the triples will always be primitive.
The general formula for these triples is ( 2 n + 1 , 2 n 2 + 2 n , 2 n 2 + 2 n + 1 ) ; simple algebra proves it generates Pythagorean triples for all n ∈ N .
For the answer to the question, we need n = 7 7 ; the sum will be 4 n 2 + 6 n + 2 = 4 ( 7 1 4 ) + 6 ( 7 7 ) + 2 = 2 7 1 2 8 9 7 2 3 2 6 5 6