project euler problem 097

Large non-Mersenne prime

This problem is easy if one has an efficient algorithm to calculate power. Another headache is to find value mod 10^10 correctly.  If either is not an issue, the problem is extremely simple. It takes less than 1ms.