Its A, the solution is the point where the two lines intercept
The number of bottles in a full box is 12.
<u><em>Explanation</em></u>
Suppose, the number of bottles in a full box is ![x](https://tex.z-dn.net/?f=x)
So, the number of bottles in <u>three</u> full boxes ![=3x](https://tex.z-dn.net/?f=%3D3x)
Now, two more boxes are added, both of which have <u>one fewer bottle than the other three</u>. So, the number of bottles in these two boxes ![= 2(x-1)](https://tex.z-dn.net/?f=%3D%202%28x-1%29)
As there were 9 bottles initially and now there are 67 bottles in the fridge, <em><u>so the equation will be</u></em>....
![9+3x+2(x-1)=67\\ \\ 9+3x+2x-2=67\\ \\ 5x+7=67\\ \\ 5x=67-7\\ \\ 5x=60\\ \\ x=\frac{60}{5}=12](https://tex.z-dn.net/?f=9%2B3x%2B2%28x-1%29%3D67%5C%5C%20%5C%5C%209%2B3x%2B2x-2%3D67%5C%5C%20%5C%5C%205x%2B7%3D67%5C%5C%20%5C%5C%205x%3D67-7%5C%5C%20%5C%5C%205x%3D60%5C%5C%20%5C%5C%20x%3D%5Cfrac%7B60%7D%7B5%7D%3D12)
Thus, the number of bottles in a full box is 12.
The answer for the binary number 10101 is 21
The only pairs for the greatest common factors of 5 are 1, 5
96 = 192 * (1/2) ;
48 = 96 *(1/ 2) ;
24 = 48 *(1/2) ;
. . . . . . . . . .
It'a a geometric sequence with common ratio, r = 1 / 2 .