If a + a 1 = 2 , find the value of: a n + a n 1
where n = 2 k ; k ∈ N .
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.
a n + a n 1 = a 2 k + a 2 k 1 = ( a 2 k − 1 ) 2 + ( a 2 k − 1 1 ) 2 = ( a 2 k − 1 + a 2 k − 1 1 ) 2 − 2 = { ( a 2 k − 2 + a 2 k − 2 1 ) 2 − 2 } 2 − 2 = { ( a 2 k − 2 + a 2 k − 2 1 ) 2 − 2 } 2 − 2 = [ { ( a 2 k − k + a 2 k − k 1 ) 2 − 2 } 2 . . . . . . . . . ] 2 − 2 = [ { ( a + a 1 ) 2 − 2 } 2 . . . . . . . . . ] 2 − 2 = [ { ( 2 ) 2 − 2 } 2 . . . . . . . . . ] 2 − 2 = [ { 4 − 2 } 2 . . . . . . . . . ] 2 − 2 = 4 − 2 = 2
I didn't understand your solution.
Log in to reply
In 4th line, I use a 2 + b 2 = ( a + b ) 2 − 2 a b formula. If I apply this formula in every line, one time 7th line come. Then I can input the value of a + b = 2 . Then every time this 2 will square and minus 2 and remain 2 . In this way, at last the result come 2
It's a long and hard way to solve the problem this way. The one of @Chew-Seong Cheong is way faster!
Log in to reply
Yes, I agree. But it's also a general process! Thanks for comment.
Problem Loading...
Note Loading...
Set Loading...
Given that a + a 1 = 2 . Multiplying a throughout and rearrange a 2 − 2 a + 1 = 0 , ⟹ ( a − 1 ) 2 = 0 ⟹ a = 1 . Therefore, a n + a n 1 = 1 + 1 = 2 for all n ∈ Z .