Recent content by LS1088

I have encountered this problem in its general form: finding a^k mod n, where k is a rather large number. I have been researching on the internet for several hours but I still don't understand it well. Can anyone provide a detailed explanation as to how to solve this kind of problems?

third quadrant - x < 0 and y < 0; for some value a, x = -a and y = -a; x^2 = y^2 = a^2

Just curious. Is it possible to compute this? if yes then how?