I came across a question which uses Fermat's little theorem:
Find a positive integer n such that - 10 is divisible by 83.
The Solution given in the book:
Since 7 x 37 = 259 = 10 mod 83
We have to find a value of n such that = 7 x 37 mod 83
This is equivalent to = 37 = mod 83
By Fermat's Theorem,
= 1 mod 83 for all k.
So we need to choose n such that = mod 83
This will be satisfied if k=15
Therefore = mod 83
And so n =
This gives one value.
My problem is that I don't understand the fourth line
That is how 37 = mod 83?
So can someone please explain this?