Does there exist a sequence { a n } n ∈ N that satisfies the following equation?
a i + a j = a i − j , ∀ i , j ∈ N , i > j
If it exists, then submit a 2 0 1 8 , if it doesn't exist, submit − 1 .
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.
True but for the purposes of this problem, since you ask for the solution, don't you have to show that this is the only possible solution? Or at least that all possible solutions lead to a 2 0 1 8 being 0?
Log in to reply
This is what I do in the first part of the solution. I only use given information (the functional equation) and derive a 2 n = 0 , which is one part of the answer.
Then, I show that such a sequence actually exists by giving an example, tbe second part of the answer.
The question was "If such a sequence exists, then submit a 2 0 1 8 , else submit − 1 ." It does exist (part 2) and a 2 0 1 8 is 0 (part 1).
Log in to reply
There could be other sequences that satisfy the conditions, but for all of them a 2 0 1 8 is 0, so I didn't have to derive them.
Oooops... You are right... Didn't read it carefully enough... By the way, nice problem! But I think the m subscript in your solution is a typo?
A better way to look at it would be to plug in i = k + 1 and j = k It boils down to a i + 1 + a i = a 1 Now giving a 1 some value and building the series up, we can see that all terms with even index must be equal to zero.
Log in to reply
Interesting... So it seems that all the odd numbers need to be equal?
Log in to reply
@Geoff Pilling – This then satisfies the condition for i = k + 1 , j = k , but if you write the first few terms down, you see that it doesn't work for i = k + 2 , j = k .
Log in to reply
@Henry U – If you plug in i = k + 2 n , n ∈ N and j = k , the equation becomes
a k + 2 n + a k = a 2 n = 0 .
This means that terms whose indices differ by an even number, so also terms with odd index, have to add up to 0.
We can combine this with the fact that all odd-indexed terms have to be equal to conclude that the only such sequence is actually the zero sequence.
Problem Loading...
Note Loading...
Set Loading...
If we plug in i = 2 n , j = n , n ∈ N into the functional equation, we get
a 2 n + a n = a 2 n − n = a n ⇒ a 2 n + a n = a n ⇒ a 2 n = 0
2 0 1 8 = 2 ⋅ 1 0 0 9 ⇒ a 2 0 1 8 = 0
Now, we plug in i = n + 2 k , j = n , k ∈ N
a n + 2 k + a n = a 2 k = 0 ⇔ a n + 2 k = − a n .
Furthermore, we can compare i = n + 1 , j = n to i = n + 2 , j = n + 1
a n + 1 + a n = a 1 = a n + 2 + a n + 1 ⇔ a n + 2 = a n
What we've now found out is
From the second and third equation, for k = 1 it follows
a n + 2 = a n = − a n + 2 ⇔ a n + 2 = 0
and therefore, the only sequence that satisfies all conditions is
a n = 0 , ∀ n ∈ N