Bunuel wrote:
If G represents the number of multiples of 3 between 3^30 and 3^50, inclusive, then G must be:
I. Odd
II. Divisible by 3
III. Divisible by 9
A. I only
B. II only
C. I and II only
D. II and III only
E. I, II, and III
Let’s analyze each Roman numeral.
I. Odd
We can use the following formula:
(largest multiple of 3 in the set - smallest multiple of 3 in the set)/3 + 1 = number of multiples of 3
(3^50 - 3^30)/3 + 1
3^50/3 - 3^30/3 + 1
3^49 - 3^29 + 1
3^29(3^20 - 1) + 1
Since 3^29
...


.jpg)








