Its just adding and subtracting

A sequence { S n } \{ S_n \} of whole numbers for natural n n is defined as

S 1 = 1 S n = { S n 1 + n , S n 1 < n S n 1 n , S n 1 n \begin{aligned} { S }_{ 1 } & = 1 \\ { S }_{ n } & =\begin{cases} { S }_{ n-1 }+n,\quad { S }_{ n-1 }<n \\ { S }_{ n-1 }-n,\quad { S }_{ n-1 }\ge n \end{cases} \end{aligned}

For example S 2 = 3 { S }_{ 2 }=3 and S 3 = 0 { S }_{ 3 }=0 .

Another sequence of increasing natural numbers { C k } \{ C_k \} for natural k k for which S C k = 0 { S }_{ { C }_{ k } }=0 . Find C 7 { C }_{ 7 } .


The answer is 3279.

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.

2 solutions

Shauryam Akhoury
Jan 5, 2019

Let S a = 0 { S }_{ a }=0

S a + 1 = a + 1 { S }_{ a+1 }=a+1

S a + 2 = 2 a + 3 { S }_{ a+2 }=2a+3

S a + 3 = a { S }_{ a+3 }=a

S a + 4 = 2 a + 4 { S }_{ a+4 }=2a+4

S a + 5 = a 1 { S }_{ a+5 }=a-1

S a + 6 = 2 a + 5 { S }_{ a+6 }=2a+5

S a + 7 = a 2 { S }_{ a+7 }=a-2 and so on..

Notice S a + ( 2 m + 1 ) = a + 1 m { S }_{ a+(2m+1) }=a+1-m and that the minimum value for S b { S }_{ b } between n + 1 b 2 m + 1 n+1\le b\le 2m+1 between one 0 0 and next 0 0 is at b = 2 m + 1 b=2m+1

For m = a + 1 m=a+1

S n + ( 2 m + 1 ) = S 3 n + 3 = 0 { S }_{ n+(2m+1) }={ S }_{ 3n+3 }=0

Then

C k + 1 = 3 C k + 3 { C }_{ k+1 }=3{ C }_{ k }+3 and C 1 = 3 { C }_{ 1 }=3

Solving this recurrence relation,we get

C k = 3 k + 1 3 2 { C }_{ k }=\frac { 3^{ k+1 }-3 }{ 2 }

For k = 7 k=7 , C 7 = 3279 { C }_{ 7 }=3279

Jordan Cahn
Jan 7, 2019

Assume that S n = 0 S_n=0 . Then S n + 1 = n + 1 S_{n+1}=n+1 , S n + 2 = 2 n + 3 S_{n+2} = 2n+3 and S n + 3 = n S_{n+3} = n . This pattern will continue, with S n + 2 k = 2 n + k + 2 S_{n+2k} = 2n+k+2 and S n + ( 2 k + 1 ) = n k + 1 S_{n+(2k+1)} = n - k + 1 , until we reach S n + ( 2 m + 1 ) = 0 S_{n+(2m+1)} = 0 , where m = n + 1 m=n+1 . Thus, we can define C k \langle C_k\rangle recursively by

  • C 1 = 3 C_1 = 3
  • C k = C k 1 + 2 ( C k 1 + 1 ) + 1 = 3 C k 1 + 3 C_k = C_{k-1} + 2(C_{k-1}+1)+1 = 3C_{k-1} + 3

Solving this recurrence relation yields C k = 3 k + 1 3 2 C_k = \frac{3^{k+1}-3}{2} and C 7 = 3 8 3 2 = 3270 C_7 = \frac{3^8-3}{2} = \boxed{3270} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...