Find the remainder of the division ofby
Could someone please explain how I would do this without a calculator??
Thanks in advance!
...
and so on until you have come down to, is one way. Then you will have to work your way up again, but use the modulus rule
this time to get the values in the interval
.
Another way is to make a table over modulus values for different exponents of 23.
...
and so on. Eventually, you will get the same modulu value as you have had before, then you know that the modulu values will begin to repeat. When you have found the period of repetition (in this case, so the period will be 21), you can calculate which of the exponents in your table that has the same modulu value as
.

Hello, hunkydory19!
There is a rather primitive method for solving these . . .Find the remainder of the division ofby
![]()
. . (I'll omit a LOT of the trial-and-error that I used.)
We try: .
. . Then: .
Hence: .
Then: .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
Hence: .
Then: .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
Hence: .
That is: .has a remainder of 1.
Then: .
Now go to work on
. . [Hint: .]