Looks like
bebs just beat me to it (great solution!), but there's another option if you aren't feeling confident with the binomial theorem: when numbers are this massive, try finding a pattern. After all, exponents and remainders all relate to number properties (specifically divisibility), and number properties follow patterns.
3^1 = 3 --> 3/8 gives r: 33^2 = 9 --> 9/8 gives r: 13^3 = 27 --> 27/8 gives r: 33^4 = 81 --> 81/8 gives r: 1At this point, we should be able to see that the patterns of remainders repeats every 2 numbers. In other words, whenever we have an even exponent, the remainder will be 1, and whenever we have an odd exponent, the remainder will be 3. In this problem, our exponent is even, so our remainder will be 1.
This method can also be applied to the problems Karishma provided — for instance, Question 2:
2^1 = 2 --> 2/9 gives r: 22^2 = 4 --> 4/9 gives r: 42^3 = 8 --> 8/9 gives r: 82^4 = 16 --> 16/9 gives r: 72^5 = 32 --> 32/9 gives r: 52^6 = 64 --> 64/9 gives r: 12^7 = 128 --> 128/9 gives r: 22^8 = 252 --> 256/9 gives r: 4This was a harder pattern to find (honestly about as difficult as you can reasonably expect from the GMAT), but we find that the pattern of remainders repeats every 6 numbers. So when the exponent is a multiple of 6 (i.e. we have 2^6n), the remainder will be 1. When the exponent is one higher than a multiple of 6 (i.e. we have 2^(6n+1), the remainder will be 2. When the exponent is two higher than a multiple of 6 (i.e. we have 2^(6n+2), the remainder will be 4. And so on. 86 is 2 higher than 84, the closest multiple of 6. Therefore, the remainder will be 4.
Takeaway:
when you're dealing with big numbers and number properties, you can likely find a pattern. Just be sure to stay organized and calculate carefully!