SAT1000 - P876

Given that an infinite sequence { a n } \{a_n\} consists of k k distinct values, S n = i = 1 n a i S_n=\displaystyle \sum_{i=1}^n a_i .

If n N + \forall n \in \mathbb N^+ , S n { 2 , 3 } S_n \in \{2,3\} , then find the maximum of k k .


Have a look at my problem set: SAT 1000 problems


The answer is 4.

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.

1 solution

Alexander Shannon
Jun 21, 2020

a 1 a_1 is either 2 2 or 3 3 , so we can have S 1 { 2 , 3 } S_1\in \{2,3\} . In either case, if S n = 2 S_n=2 , the options for a n + 1 a_{n+1} are { 0 , 1 } \{0,1\} , and if S n = 3 S_n=3 , the options for a n + 1 a_{n+1} are { 0 , 1 } \{0,-1\} . Therefore, we can have only 4 4 distinct values { 0 , 1 , + 1 , a 1 } \{0,-1,+1,a_1\} , where a 1 = 2 a_1=2 or a 1 = 3 a_1=3 .

You know what else is interesting?

Alexander Shannon - 11 months, 3 weeks ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...