This would be a pretty difficult question as it tests fairly high level modular arithmetic. Probably higher than the GMAT goes.
It helps to realize 51 is one less than a multiple of 13.
Let's call any multiple of 13 'M13.' So any number 1 less than that is 'M13 - 1'
We have here a situation of raising 'M13 - 1' to a power of 25.
(M13 - 1)*(M13 - 1)*(M13 - 1)...*(M13 - 1)
{25 times}
Consider just (M13 - 1)^2 = (M13 ^ 2 - 2M13 + 1)
Since (M13)^2 and 2(M13) are both multiples of 13, we know (M13 ^ 2 - 2M13 + 1) is 1 more than a multiple of 13. So this can be written as (M13 + 1)
If we multiple (M13+1)*(M13 - 1), well, that's a difference of squares: M13^2 - 1 (...this is a little deceptive, since 'M13' doesn't have to be the *same* multiple of 13, BUT this is beauty of modular arithmetic... you only care about the numbers in relation to the number you're dividing by).
(M13)^2 is another M13, so this is just another (M13 - 1)
*basically*, when we multiply a bunch of 'M13 - 1' together, we'll end up with a multiple of 13 + or - '1.'
Whether it's '+' or '-' depends on the exponent. As you might expect, even exponents will be '+1,' odd will be '-1.'
Since 25 is odd, we'll end up at 'M13 - 1,' which will have a remainder of 12 when divided by 13.
...Again, I don't think I've had to do anything this advanced in the field of modular arithmetic on a GMAT problem in 7 or 8 years of teaching it.