Bunuel
The infinite sequence of nonzero integers \(a_1\), \(a_2\), \(a_3\), ... is such that \(a_n = (a_{n-1})(a_{n-2})^3\) for \(n > 2\), and \(a_2 = 2\).
Select for \(a_3\) and \(a_5\) the values of \(a_3\) and \(a_5\), respectively, that would be jointly consistent with the given information. Make only two selections, one in each column.
\(a_2\) = 2
Let \(a_1\) = x
From \(a_3\) onwards we have
\(a_n = (a_{n-1})(a_{n-2})^3\)
=> \(a_3\) = \(a_2\) * \({a_1} ^3\) = 2 * \(x^3\)
=> \(a_4\) = \(a_3\) * \({a_2} ^3\) = 2 * \(x^3\) * \(2^3\) = 16 * \(x^3\)
=> \(a_5\) = \(a_4\) * \({a_3} ^3\) = 16 * \(x^3\) * \(2^3 * {x^3} ^3\) = 128 * \(x^{12}\)
Now considering \(a_5\) = 128 * \(x^{12} \) we know the highest number in the option is 128 hence we start by putting the value of 'x' = 1 or -1
=> \(a_5\) = 128 * \(1^{12} \) = 128
Now put the same value of 'x' in \(a_3\) we get
\(a_3\) = 2 * \(1^3\) = 2
However, 2 is not in the options so x cannot be 1
Now using x = -1 we get
=> \(a_5\) = 128 * \({-1}^{12} \) = 128
Now put the same value of 'x' in \(a_3\) we get
\(a_3\) = 2 * \( {-1} ^3\) = -2
This works
Hence the choices are
\(a_3\) = -2\(a_5\) = 128