\(s_n\) is divisible by 4 -> \(s_{n+1} = s_n + 2\)
\(s_n\) is NOT divisible by 4 -> \(s_{n+1} = s_n + 3\)
Assume \(s_{4}\) is \(x\)
Case 1 : \(x\) is divisible by 4
\(s_{5}\) = \(s_{4} + 2 = x + 2 \)
\(s_{5}\) cannot be divisible by 4 (there must be a difference of 4 between two multiples of 4)
\(s_{6} = s_{5} + 3 = x + 5 \)
Case 2 : \(x\) is NOT divisible by 4
\(s_{5}\) = \(s_{4} + 3 = x + 3 \)
\(s_{5}\) maybe divisible by 5. Assuming both cases
a) \(s_{5}\) divisible by 5
\(s_{6} = s_{5} + 2 = x + 5\)
b) \(s_{5}\) is NOT divisible by 5
\(s_{6} = s_{5} + 3 = x + 6\)
So possible options of\( s_{4}\) and\( s_{6}\) are\( (x, x+5)\) and \((x, x+6)\)
Based on options that is only (8, 13)
Bunuel
12 Days of Christmas 2024 - 2025 Competition with $40,000 of Prizes
A sequence of integers is defined using the following logic: If \(s_n\) is divisible by 4, then \(s_{n+1} = s_n + 2\). If \(s_n\) is not divisible by 4, then \(s_{n+1} = s_n + 3\).
Select values for \(s_4\) and \(s_6 \)that are jointly consistent with these conditions. Make only two selections, one in each column.