Mathematics, 10.12.2021 20:50 tink921
Hi! Can somebody please help me? I have been stuck on this question for too long now.
Examine this set of Pythagorean triples from part C. Look for a pattern that is true for each triple regarding the difference between the three values that make up the triple. Describe this pattern. Then see if you can think of another Pythagorean triple that doesn’t follow the pattern you just described and that can’t be generated using the identity (x^2 - 1)^2 + (2x)^2 = (x^2 + 1)^2. Explain your findings.
The Set of Pythagorean triples:
x-value Pythagorean Triple
7 (14,48,50)
8 (16,63,65)
9 (18,80,82)
10 (20,99,101)
Answers: 2
Mathematics, 20.06.2019 18:04
George is 187 cm tall. his son, ralph, is 142 cm tall. who casts the longer shadow. george when the sun is 65° above the horizon, or ralph when the sun is 56° above the horizon? how much longer? (nearest centimeter)
Answers: 2
Mathematics, 21.06.2019 18:30
Dakota earned $7.50 in interest in account a and $18.75 in interest in account b after 15 months. if the simple interest rate is 4% for account a and 5% for account b, which account has the greater principal? explain. to make it a little easier, there is an image. good luck!
Answers: 1
Mathematics, 21.06.2019 21:00
Which expression is equal to (21)(7)(3x) using the associative property? (21 · 7 · 3)x (7)(21)(3x) 32(7 + 3x) (3x)(7)(21)
Answers: 2
Mathematics, 21.06.2019 21:00
Asequence has its first term equal to 4, and each term of the sequence is obtained by adding 2 to the previous term. if f(n) represents the nth term of the sequence, which of the following recursive functions best defines this sequence? (1 point) f(1) = 2 and f(n) = f(n − 1) + 4; n > 1 f(1) = 4 and f(n) = f(n − 1) + 2n; n > 1 f(1) = 2 and f(n) = f(n − 1) + 4n; n > 1 f(1) = 4 and f(n) = f(n − 1) + 2; n > 1 i will award !
Answers: 1
Hi! Can somebody please help me? I have been stuck on this question for too long now.
Examine this...
Biology, 28.06.2021 15:30
World Languages, 28.06.2021 15:30
Computers and Technology, 28.06.2021 15:30
Mathematics, 28.06.2021 15:30
Computers and Technology, 28.06.2021 15:30
Mathematics, 28.06.2021 15:30