Analyze the constraint Since x3 is a multiple of 81 = 34, we need x3 to be divisible by 34.
For x3 to be divisible by 34, x must be divisible by at least 32 = 9. (Since if x = 3a × k where gcd(k,3) = 1, then x3 = 33a × k3, and we need 3a ≥ 4, so a ≥ 4/3, meaning a ≥ 2)
So x must be a multiple of 9.
Check each optionOption I: Remainder 0 If x ≡ 0 (mod 36), then x is a multiple of 36. Since 36 = 9 × 4, x is also a multiple of 9.
Option II: Remainder 3 If x ≡ 3 (mod 36), then x = 36k + 3 = 3(12k + 1). Since 12k + 1 is not divisible by 3, x is only divisible by 31, not 32. So x is not a multiple of 9.
Option III: Remainder 27 If x ≡ 27 (mod 36), then x = 36k + 27 = 9(4k + 3). So x is a multiple of 9. ✓
Verify with examples- For remainder 0: x = 36, x3 = 46,656 = 81 × 576
- For remainder 27: x = 27, x3 = 19,683 = 81 × 243
Answer: D. I and III only