Ever since I started doing work on Bézout Identity and Extended Euclidean Algorithm, I have tried to understand how to do modular arithmetic of big numbers etc. Basically, I have come up with the following problem of my own that I wish to solve:
$t = 24^3 \mod 35$
We know that $35 = 7\cdot 5$ and both $7$ and $5$ are prime numbers. I believe that there is a way of doing modular arithmetic of this nature if the modulus number is coprime like in this case.
I got as far as this: $$t = 24^3 \mod 7$$ $$t = 24^3 \mod 5$$
What do I do after? It would be great if someone could help me compute this answer as I am very keen to better understand all of this using my own examples.
Please I am new to CRT and any help of steps of calculating this would mean a lot!