Solved Exercises on Pythagorean Triples in Grade 8

Master Pythagorean triples: identifying, generating, and using primitive and non-primitive triples in geometry through these 5 detailed exercises.

Solution: Exercises 1 to 3
1 Identifying Pythagorean Triples
Exercise 1
Which of the following sets of numbers form a Pythagorean triple: (5, 12, 13), (6, 8, 10), (7, 8, 9)?
Definition:

Pythagorean Triple: A set of three positive integers (a, b, c) such that a² + b² = c², where c is the largest number.

Primitive Triple: A Pythagorean triple where a, b, and c have no common factor other than 1.

Identification Method:
  1. Identify the largest number as the potential hypotenuse
  2. Square each of the three numbers
  3. Check if the sum of squares of the two smaller numbers equals the square of the largest
  4. If yes, it's a Pythagorean triple
Set 1
(5,12,13)
Squares
25,144,169
Verification
25+144=169 ✓
Step 1: Test (5, 12, 13)

Identify the largest: 13

Calculate squares: 5² = 25, 12² = 144, 13² = 169

Check: 5² + 12² = 25 + 144 = 169 = 13²

✓ This is a Pythagorean triple

Step 2: Test (6, 8, 10)

Identify the largest: 10

Calculate squares: 6² = 36, 8² = 64, 10² = 100

Check: 6² + 8² = 36 + 64 = 100 = 10²

✓ This is a Pythagorean triple

Step 3: Test (7, 8, 9)

Identify the largest: 9

Calculate squares: 7² = 49, 8² = 64, 9² = 81

Check: 7² + 8² = 49 + 64 = 113 ≠ 81 = 9²

✗ This is NOT a Pythagorean triple

Step 4: Conclusion

(5, 12, 13) and (6, 8, 10) are Pythagorean triples

(7, 8, 9) is not a Pythagorean triple

(5,12,13) and (6,8,10) are Pythagorean triples
Final answer:

(5, 12, 13) and (6, 8, 10) form Pythagorean triples because 5² + 12² = 13² (25 + 144 = 169) and 6² + 8² = 10² (36 + 64 = 100). (7, 8, 9) does not form a Pythagorean triple because 7² + 8² ≠ 9² (49 + 64 = 113 ≠ 81).

Applied rules:

• Pythagorean Triple Definition: a² + b² = c² where c is the largest number

• Verification: Always check that the equality holds

• Common Factors: (6,8,10) is a multiple of (3,4,5)

2 Generating Multiples
Exercise 2
If (3, 4, 5) is a Pythagorean triple, generate two more triples by multiplying by different integers.
Generating Multiples:

Scalar Multiplication: If (a, b, c) is a Pythagorean triple, then (ka, kb, kc) is also a Pythagorean triple for any positive integer k.

Proof: If a² + b² = c², then (ka)² + (kb)² = k²a² + k²b² = k²(a² + b²) = k²c² = (kc)²

Base Triple
(3,4,5)
Multiplier 1
k=2
Multiplier 2
k=3
Step 1: Start with the base triple (3, 4, 5)

Verify: 3² + 4² = 9 + 16 = 25 = 5²

This confirms (3, 4, 5) is a Pythagorean triple

Step 2: Multiply by k = 2

New triple: (2×3, 2×4, 2×5) = (6, 8, 10)

Verification: 6² + 8² = 36 + 64 = 100 = 10²

Step 3: Multiply by k = 3

New triple: (3×3, 3×4, 3×5) = (9, 12, 15)

Verification: 9² + 12² = 81 + 144 = 225 = 15²

Step 4: Verify both new triples

(6, 8, 10): 6² + 8² = 36 + 64 = 100 = 10² ✓

(9, 12, 15): 9² + 12² = 81 + 144 = 225 = 15² ✓

(6,8,10) and (9,12,15) are Pythagorean triples
Final answer:

Two Pythagorean triples generated from (3,4,5) are: (6,8,10) and (9,12,15). These are formed by multiplying the base triple by 2 and 3 respectively.

Applied rules:

• Scalar Multiplication Property: Multiplying all sides by the same integer preserves the Pythagorean relationship

• Generation Method: Use a known primitive triple to generate others

• Verification: Always verify the new triple satisfies the equation

3 Primitive vs Non-Primitive Triples
Exercise 3
Determine whether (8, 15, 17) and (12, 16, 20) are primitive or non-primitive Pythagorean triples.
Primitive vs Non-Primitive:

Primitive Triple: A Pythagorean triple where the three numbers share no common factor other than 1 (gcd = 1).

Non-Primitive Triple: A Pythagorean triple where the three numbers share a common factor greater than 1.

Triple 1
(8,15,17)
Triple 2
(12,16,20)
Classification
Prim/Non-prim
Step 1: Analyze (8, 15, 17)

Check if 8, 15, and 17 have common factors

Factors of 8: 1, 2, 4, 8

Factors of 15: 1, 3, 5, 15

Factors of 17: 1, 17 (prime number)

Only common factor is 1, so gcd(8,15,17) = 1

Verify: 8² + 15² = 64 + 225 = 289 = 17² ✓

Step 2: Analyze (12, 16, 20)

Check if 12, 16, and 20 have common factors

Factors of 12: 1, 2, 3, 4, 6, 12

Factors of 16: 1, 2, 4, 8, 16

Factors of 20: 1, 2, 4, 5, 10, 20

Common factors: 1, 2, 4. Greatest common divisor is 4

Verify: 12² + 16² = 144 + 256 = 400 = 20² ✓

Step 3: Conclusion

(8, 15, 17) is a primitive triple (gcd = 1)

(12, 16, 20) is a non-primitive triple (gcd = 4)

Step 4: Additional insight

(12, 16, 20) = 4 × (3, 4, 5), confirming it's non-primitive

(8,15,17) is primitive, (12,16,20) is non-primitive
Final answer:

(8, 15, 17) is a primitive Pythagorean triple because gcd(8,15,17) = 1 and 8² + 15² = 17². (12, 16, 20) is a non-primitive Pythagorean triple because gcd(12,16,20) = 4 and 12² + 16² = 20².

Applied rules:

• Primitive Definition: GCD of all three numbers equals 1

• Non-Primitive Definition: GCD of all three numbers greater than 1

• Classification: Helps understand the structure of triples

Pythagorean Triples Rules and Properties
\(a^2 + b^2 = c^2\)
Pythagorean Triple Condition
Primitive
gcd(a,b,c)=1
No common factors
Non-Primitive
gcd(a,b,c)>1
Common factors exist
Generation Formula
a=m²-n², b=2mn, c=m²+n²
Where m>n>0
Common Triples: (3,4,5), (5,12,13), (7,24,25), (8,15,17), (9,12,15)
Even-Odd Pattern: One leg even, one leg odd, hypotenuse odd (primitive)
Generating Formula: For integers m > n > 0: a = m² - n², b = 2mn, c = m² + n²
Solution: Exercises 4 to 5
4 Using Generation Formula
Exercise 4
Use the generation formula with m = 4 and n = 1 to find a Pythagorean triple.
Generation Formula:

Euclid's Formula: For positive integers m > n, a = m² - n², b = 2mn, c = m² + n² forms a Pythagorean triple.

Conditions: m > n > 0, and m and n are coprime (gcd = 1), not both odd.

Parameters
m=4, n=1
Calculations
a=15, b=8, c=17
Triple
(8,15,17)
Step 1: Apply the generation formula

Given: m = 4, n = 1

a = m² - n² = 4² - 1² = 16 - 1 = 15

b = 2mn = 2 × 4 × 1 = 8

c = m² + n² = 4² + 1² = 16 + 1 = 17

Step 2: Form the triple

The triple is (a, b, c) = (15, 8, 17)

Or rearranged with the largest number last: (8, 15, 17)

Step 3: Verify the triple

Check: 8² + 15² = 64 + 225 = 289 = 17² ✓

Step 4: Check if primitive

gcd(8, 15, 17) = 1 (since 17 is prime and doesn't divide 8 or 15)

Therefore, (8, 15, 17) is a primitive triple

The triple is (8,15,17)
Final answer:

Using m = 4 and n = 1 in the generation formula, we get the Pythagorean triple (8, 15, 17). This is verified since 8² + 15² = 64 + 225 = 289 = 17².

Applied rules:

• Euclid's Formula: Systematic way to generate Pythagorean triples

• Verification: Always check that the generated triple satisfies the equation

• Parameter Conditions: Ensure m > n > 0

5 Real-World Application
Exercise 5
A rectangular garden has dimensions 9 meters by 12 meters. What is the length of the diagonal path across the garden? Is this length part of a Pythagorean triple?
Real-World Context:

Diagonal of Rectangle: Forms the hypotenuse of a right triangle with the rectangle's sides as legs.

Practical Application: Pythagorean triples appear in construction, architecture, and design.

Rectangle
9×12
Diagonal
d=15
Triple
(9,12,15)
Step 1: Model the problem

The diagonal of the rectangle forms a right triangle with sides 9 and 12 meters

Let d be the diagonal (hypotenuse)

Step 2: Apply the Pythagorean theorem

d² = 9² + 12²

d² = 81 + 144 = 225

d = √225 = 15 meters

Step 3: Check if it's a Pythagorean triple

We have the triple (9, 12, 15)

Check: 9² + 12² = 81 + 144 = 225 = 15² ✓

Step 4: Determine if primitive

Find gcd(9, 12, 15):

Factors of 9: 1, 3, 9

Factors of 12: 1, 2, 3, 4, 6, 12

Factors of 15: 1, 3, 5, 15

Common factors: 1, 3. Therefore, gcd(9,12,15) = 3

This is a non-primitive triple: (9,12,15) = 3×(3,4,5)

Diagonal = 15m, Triple = (9,12,15)
Final answer:

The diagonal path across the garden is 15 meters long. The sides (9, 12, 15) form a Pythagorean triple since 9² + 12² = 15² (81 + 144 = 225). This is a non-primitive triple, being 3 times the primitive triple (3, 4, 5).

Applied rules:

• Diagonal Calculation: Use Pythagorean theorem for rectangles

• Real-World Modeling: Convert physical problems to geometric ones

• Triple Verification: Check if the result forms a known pattern

Pythagorean Triples Laws, Methods, Definitions
\(a^2 + b^2 = c^2\)
Pythagorean Triple Condition
Key definitions:

Pythagorean Triple: A set of three positive integers (a, b, c) satisfying a² + b² = c², where c is the largest number.

Primitive Triple: A Pythagorean triple where gcd(a, b, c) = 1 (no common factors).

Non-Primitive Triple: A Pythagorean triple where gcd(a, b, c) > 1 (has common factors).

Generation Formula: Euclid's formula for generating triples: a = m² - n², b = 2mn, c = m² + n².

Complete methodology:
  1. Identification: Given three numbers, check if a² + b² = c² (with c being the largest)
  2. Classification: Determine if gcd(a, b, c) = 1 (primitive) or > 1 (non-primitive)
  3. Generation: Use Euclid's formula with parameters m and n
  4. Verification: Always check that the generated or identified triple satisfies the equation
Tip 1: Memorize common primitive triples: (3,4,5), (5,12,13), (7,24,25), (8,15,17), (9,40,41).
Tip 2: For primitive triples, one leg is even, one is odd, and the hypotenuse is odd.
Tip 3: Any non-primitive triple is a multiple of a primitive triple.
Tip 4: To verify a triple, always square each number and check the sum.
Tip 5: Use Euclid's formula systematically: choose m > n, then compute a, b, c.
Common errors: Forgetting to identify the largest number as the hypotenuse, arithmetic mistakes in squaring.
Exam preparation: Practice identifying and generating both primitive and non-primitive triples.
Formulas to know by heart:

• Pythagorean Triple: a² + b² = c²

• Euclid's Formula: a = m² - n², b = 2mn, c = m² + n²

• Primitive Condition: gcd(a, b, c) = 1

• Non-Primitive Condition: gcd(a, b, c) > 1

Pythagorean Triples Visualization
Common Pythagorean Triples
Visualization of the relationship between the sides of common Pythagorean triples:
• (3,4,5), (5,12,13), (7,24,25), (8,15,17), (9,12,15)

Analysis: The chart shows the relationship between the legs and hypotenuse of common Pythagorean triples.

  • Each point represents a triple where the legs form the x,y coordinates and hypotenuse is shown in the legend
  • Primitive triples (blue) have no common factors between all three numbers
  • Non-primitive triples (red) are multiples of primitive triples

Questions & Answers

Question: What's the difference between primitive and non-primitive Pythagorean triples? Why does it matter?

Answer: Great question! Here's the difference:

  • Primitive Triple: The three numbers have no common factor other than 1 (gcd = 1)
  • Non-Primitive Triple: The three numbers share a common factor greater than 1

Examples:

  • Primitive: (3, 4, 5) - gcd(3,4,5) = 1
  • Non-Primitive: (6, 8, 10) - gcd(6,8,10) = 2

Why it matters:

  • Primitive triples are the "building blocks" - all non-primitive triples are multiples of primitive ones
  • Understanding the structure helps in generating and recognizing triples
  • Primitive triples have interesting mathematical properties (like the even-odd pattern)

For (6,8,10): It's just 2×(3,4,5), so it's derived from a primitive triple!

Question: How do I generate Pythagorean triples myself? Is there a formula?

Answer: Yes! There's a beautiful formula called Euclid's formula:

For any two positive integers m and n where m > n:

  • a = m² - n² (one leg)
  • b = 2mn (other leg)
  • c = m² + n² (hypotenuse)

Example with m=2, n=1:

  • a = 2² - 1² = 4 - 1 = 3
  • b = 2×2×1 = 4
  • c = 2² + 1² = 4 + 1 = 5

This gives us the (3,4,5) triple! Try different values of m and n to generate more triples.

Note: For a primitive triple, m and n should be coprime (gcd=1) and not both odd.

Question: Are there infinitely many Pythagorean triples? How many primitive ones exist?

Answer: Yes, there are infinitely many Pythagorean triples, and infinitely many primitive ones too!

Here's why:

  • Using Euclid's formula with different values of m and n generates infinitely many primitive triples
  • For every primitive triple, we can create infinitely many non-primitive ones by scaling
  • For example, from (3,4,5) we get: (6,8,10), (9,12,15), (12,16,20), etc.

Some infinite sequences of primitive triples:

  • Using m=n+1: (3,4,5), (5,12,13), (7,24,25), (9,40,41), ...
  • Using n=1: (3,4,5), (8,15,17), (24,35,37), ...

The set of primitive Pythagorean triples is countably infinite, meaning we can list them all in a sequence.