A sequence { S n } of whole numbers for natural n is defined as
S 1 S n = 1 = { S n − 1 + n , S n − 1 < n S n − 1 − n , S n − 1 ≥ n
For example S 2 = 3 and S 3 = 0 .
Another sequence of increasing natural numbers { C k } for natural k for which S C k = 0 . Find C 7 .
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.
Assume that S n = 0 . Then S n + 1 = n + 1 , S n + 2 = 2 n + 3 and S n + 3 = n . This pattern will continue, with S n + 2 k = 2 n + k + 2 and S n + ( 2 k + 1 ) = n − k + 1 , until we reach S n + ( 2 m + 1 ) = 0 , where m = n + 1 . Thus, we can define ⟨ C k ⟩ recursively by
Solving this recurrence relation yields C k = 2 3 k + 1 − 3 and C 7 = 2 3 8 − 3 = 3 2 7 0 .
Problem Loading...
Note Loading...
Set Loading...
Let S a = 0
S a + 1 = a + 1
S a + 2 = 2 a + 3
S a + 3 = a
S a + 4 = 2 a + 4
S a + 5 = a − 1
S a + 6 = 2 a + 5
S a + 7 = a − 2 and so on..
Notice S a + ( 2 m + 1 ) = a + 1 − m and that the minimum value for S b between n + 1 ≤ b ≤ 2 m + 1 between one 0 and next 0 is at b = 2 m + 1
For m = a + 1
S n + ( 2 m + 1 ) = S 3 n + 3 = 0
Then
C k + 1 = 3 C k + 3 and C 1 = 3
Solving this recurrence relation,we get
C k = 2 3 k + 1 − 3
For k = 7 , C 7 = 3 2 7 9