Given condition,
x is a positive integer and x^3 is a multiple of 81.
First, let's find the prime factorization of 81: 81=9×9 =3 ^4
Since x^3 is a multiple of 81, we can write x^3 =81k for some integer k.
x ^3 = 3^4* k
For x^3 to be a multiple of 3^4, the prime factorization of x^3 must contain at least 3^4
Let the prime factorization of x be x=3^a*m, where m is an integer not divisible by 3.
Then x ^3 =(3^3a*m^3)
For x^3 to be a multiple of 3^4 , we must have 3a greator than or equal 4.
Since a must be an integer, the smallest possible value for 3a that is greater than or equal to 4 is a=2, because 3×2=6.
If a=1, 3a=3, which is not greator than or equal 4.
So, a must be at least 2.
This means that x must be a multiple of 3^2 =9.
So, x=9n for some positive integer n.
Now we need to find the possible remainders when x is divided by 36.
Since x=9n, we can write x as:
If n=1, x=9. Remainder when 9 is divided by 36 is 9.
If n=2, x=18. Remainder when 18 is divided by 36 is 18.
If n=3, x=27. Remainder when 27 is divided by 36 is 27.
If n=4, x=36. Remainder when 36 is divided by 36 is 0.
If n=5, x=45. Remainder when 45 is divided by 36 is 9.
If n=6, x=54. Remainder when 54 is divided by 36 is 18.
If n=7, x=63. Remainder when 63 is divided by 36 is 27.
If n=8, x=72. Remainder when 72 is divided by 36 is 0.
The possible remainders when x is divided by 36 are 0, 9, 18, and 27.
Let's check the given options:
I. 0: Yes, this is a possible remainder (e.g., when x=36).
II. 3: No, this is not a possible remainder.
III. 27: Yes, this is a possible remainder (e.g., when x=27).
Therefore, the possible remainders are I and III