We are given the recurrence relation a(n) = a_(n-1) * (a_(n-2))^3 for n > 2, with a_2 = 2. The term a(1) must be a non-zero integer.
First, let's express the terms we need, a_3 and a_5, using the given information.
For n = 3, the formula gives:
a_3 = a_2 * a_1^3
Since a(2) = 2, this becomes:
a_3 = 2 * (a_1)^3
Next, let's derive an expression for a_5. We first need a_4.
For n = 4: a_4 = a_3 * (a_2)^3 = a_3 * (2)^3 = 8 * a_3.
For n = 5: a_5 = a_4 * a_3^3.
Substituting our expression for a_4, we get:
a_5 = (8 * a_3) * (a_3)^3 = 8 * (a_3)^4.
So, we have two key equations:
1. a_3 = 2 * (a_1)^3
2. a_5 = 8 * (a_3)^4
The first equation tells us that a_1 is the cube root of a_3/2. Since a_1 must be a non-zero integer, we can test the options provided for a_3 to see which one yields an integer value for a_1.
Let's test the option a_3 = -2.
If a_3 = -2, then (a_1)^3 = -2 / 2 = -1. The cube root of -1 is -1, so a_1 = -1. This is a valid non-zero integer.
Now, we use this value of a_3 to find the corresponding value of a_5 using our second equation.
If a_3 = -2, then a_5 = 8 * (-2)^4 = 8 * 16 = 128.
The pair of values a_3 = -2 and a_5 = 128 are both present in the options list and are consistent with the sequence's rules, originating from a_1 = -1. Checking other options for a_3 will not produce a value for a_5 that is also in the list.
Therefore, the correct value for a_3 is -2 and for a_5 is 128.
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.