Commentary
The first thing to do is to try multiplying some fractions and see what integers you can get. Hopefully you can find how to obtain any integer greater than 1 using Alia’s fractions, and decide that Bella cannot obtain any integers.
Catherine’s task is more challenging. You may want to start by listing several of her fractions — \(\dfrac{3}{3}, \dfrac{7}{5}, \dfrac{11}{7}, \dfrac{15}{9}, \dots\) — and seeing what integers can be obtained from them.
After some experimenting, you may start to suspect that you can obtain larger odd integers by using some of the smaller ones. For example, if you can obtain 7 then you can use it to obtain 11 by doing \(\dfrac{11}{7} \times 7\).
Integers that do not appear as numerators of Catherine’s fractions are a bit more difficult. For example, to obtain 13 you need to realise that 39 appears as a numerator in \(\dfrac{39}{21}\), and so you can obtain 13 as \(\dfrac{39}{21} \times 7\).
This suggests that you should look for a slightly different calculation depending on whether the required odd integer is of the form \(4m - 1\) or \(4m + 1\). Integers of the form \(4m - 1\) appear as numerators of Catherine’s fractions, so if you can obtain \(2m + 1\) then you can also obtain \(4m - 1 = (2m + 1) \times \dfrac{4m - 1}{2m + 1}\). To obtain an integer of the form \(4m + 1\) you need to look at \(3(4m + 1) = 12m + 3\), because this does appear as the numerator of the fraction \(\dfrac{12m + 3}{6m + 3}\).
Taking \(n = 1\), Alia gets the integer 2. Now if \(N > 2\), then Alia can obtain \(N\) as \(\dfrac{2}{1} \times \dfrac{3}{2} \times \dots \times \dfrac{N}{N - 1}\).
Thus Alia can obtain any positive integer except 1. (She cannot obtain 1 because all her fractions are greater than 1.)
Bella, however, cannot obtain any positive integers. Her store consists of fractions of the form \(\dfrac{N}{3D}\), where the positive integer \(N\) is not a multiple of 3.
If she multiplies \(m\) of these fractions together she will obtain a fraction of the form \(\dfrac{X}{3^mY}\) , where the positive integer \(X\) is not multiple of 3. Since the term \(3^m\) cannot cancel, this will never be a positive integer (we must have \(m \ge 1\)).
Since the fractions available to Catherine have odd numerator and odd denominator, the same will be true of any fraction she can create by multiplying them. Therefore she certainly cannot reach any even positive integers. She can, however, reach every odd positive integer.
This may be seen as follows. Let \(f(q)\) be the fraction \(\dfrac{4q - 1}{2q + 1}\).
Then \(f(1) = 1\), \(f(4) \times f(7) = \dfrac{15}{9} \times \dfrac{27}{15} = 3\), and \(3 \times f(4) = 3 \times \dfrac{15}{9} = 5\). Thus Catherine can obtain 1, 3 and 5.
Suppose now that \(m \ge 2\) and Catherine has managed to obtain all odd numbers up to and including \(4m - 3\). We know that she can do this for \(m = 2\). Since \(2m + 1 \le 4m - 3\), she can obtain \(2m + 1\), and so she can use the calculations\[\begin{aligned}4m - 1 &= (2m + 1) \times \frac{4m - 1}{2m + 1} = (2m + 1) \times f(m) \quad\text{and}\\ 4m + 1 &= (2m + 1) \times \frac{12m + 3}{6m + 3} = (2m + 1) \times f(3m + 1)\end{aligned}\]to add \(4m - 1\) and \(4m + 1\) to her list, so as to extend it to all odd numbers up to and including \(4m + 1 = 4(m + 1) - 3\).
This means that, having obtained 5, she can obtain 7 and 9, then 11 and 13, and so on. Hence Catherine can obtain any odd positive integer.
Note
The method we used for Catherine, where we prove a result about a certain positive integer by using the same result for a smaller integer, is called proof by induction. You may learn about it in your future studies; it is a very useful method for proving results about positive integers.