A sequence { a i } i = 1 ∞ of integers is defined by: a n = ⎩ ⎪ ⎨ ⎪ ⎧ 1 0 ( a n − 1 + a n − 2 + a n − 3 ) ( m o d 2 ) if n ≤ 3 if n = 4 if n > 4 Here n ( m o d 2 ) denotes the remainder when n is divided by 2 , i.e. n ( m o d 2 ) = { 0 1 if n ≡ 0 ( m o d 2 ) if n ≡ 1 ( m o d 2 ) Find the number of integers n such that 1 ≤ n < 2 5 and a n = 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.
You didn't have to list all the 2 5 values of a n . Just note that it becomes periodic after a while.
Yup's... Sreejato Bhattacharya...
Problem Loading...
Note Loading...
Set Loading...
Only list:
a = [ 1 , 1 , 1 , 0 , 0 , 1 , 1 , 0 , 0 , 1 , 1 , 0 , 0 , 1 , 1 , 0 , 0 , 1 , 1 , 0 , 0 , 1 , 1 , 0 ]
Total= 1 3