We are given that x is a positive integer and x^3 is a multiple of 81.
We need to find which of the given remainders (0, 3, 27) are possible when x is divided by 36.
First, let's analyze the condition "x^3 is a multiple of 81".
81=3^4
So, x^3 must be divisible by 3^4
For x^3 to be divisible by 3^4
, x itself must contain a factor of 3 raised to a power that, when multiplied by 3 (because of x^3 ), results in at least 3^4.
Let the prime factorization of x be x=3
a*k, where k is not divisible by 3.
Then x^3 = (3a*k)^3 = 3^3a * k3
For 3^3a * k^3 to be divisible by 3^4
, we must have 3a≥4.
Since a must be an integer, the smallest integer value for a that satisfies 3a≥4 is a=2.
If a=1, 3a=3, which is not ≥4.
If a=2, 3a=6, which is ≥4.
So, x must be a multiple of 3^2 =9.
This means x must be of the form 9m for some positive integer m.
Now we need to consider the remainder when x is divided by 36.
We are looking for x(mod36).
Since x is a multiple of 9, let's list possible values of x that are multiples of 9:
x=9,18,27,36,45,54,63,72,...
Now, let's find the remainder when these values of x are divided by 36:
If x=9, 9÷36⟹ remainder is 9.
If x=18, 18÷36⟹ remainder is 18.
If x=27, 27÷36⟹ remainder is 27.
If x=36, 36÷36⟹ remainder is 0.
If x=45, 45÷36⟹ remainder is 9.
If x=54, 54÷36⟹ remainder is 18.
If x=63, 63÷36⟹ remainder is 27.
If x=72, 72÷36⟹ remainder is 0.
The possible remainders when x is divided by 36 are 0, 9, 18, 27.
Now let's compare these possible remainders with the options provided:
I. 0: This is a possible remainder.
II. 3: This is not a possible remainder.
III. 27: This is a possible remainder.
Therefore, the possible remainders are I and III.
The final answer is D