I am looking for a easy way to solve it, without use the computer. I did that but with the computer.
$GCD(250,248) \ne 1$
So I did: $250 = 125*2$
$248^{156454638}$ (mod 250) = $248^{156454638}$ (mod 125) + $248^{156454638} $(mod 2)
We know that: 248 (mod 2) = $0$ and $248^{156454638}$ (mod 2) also is $0$
so, We reduce our expresion to:
$248^{156454638}$ (mod 125) with $GCD(248,125) = 1$
Now I can use Euler:
$\varphi(125) = 100$
So I will try to reduce the big exponent:
$156,454,638 = 260,757 * 100 * 2 * 4 + 438$
and then:
$248^{156,454,638}$ (mod 125) = $248^{260,757*600}$ * $248^{438} $ (mod 125)
$248^{260,757*600}$ (mod 125) = $1$
answer must to be
$248^{438} $ (mod 125) = 69
using the computer I got 194, but I can't resolve it using just my calculator, can someone help me to find a easy way to do it? there a way to process number with big exponent?