Given that an infinite sequence consists of distinct values, .
If , , then find the maximum of .
Have a look at my problem set: SAT 1000 problems
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 1 is either 2 or 3 , so we can have S 1 ∈ { 2 , 3 } . In either case, if S n = 2 , the options for a n + 1 are { 0 , 1 } , and if S n = 3 , the options for a n + 1 are { 0 , − 1 } . Therefore, we can have only 4 distinct values { 0 , − 1 , + 1 , a 1 } , where a 1 = 2 or a 1 = 3 .