Please explain how B = a(p-1)+b and b = B%(p-1)?

#1

I am not able to get it. If you could explain with some easy example, it would be helpful.

#2

sory i didnt get your Q. can u please explain what you are trying to ask and from where ? any video or blog …

#3

Fermat’s little theorem states that if p is a prime number, then for any integer a, the number a^p – a is an integer multiple of p.
Special Case: If a is not divisible by p, Fermat’s little theorem is equivalent to the statement that a p-1-1 is an integer multiple of p.

#4

example
P = an integer Prime number
a = an integer which is not multiple of P
Let a = 2 and P = 17

According to Fermat’s little theorem
2 17 - 1 ≡ 1 mod(17)
we got 65536 % 17 ≡ 1
that mean (65536-1) is an multiple of 17

#5

for proof of little fermate theorem read this…
https://primes.utm.edu/notes/proofs/FermatsLittleTheorem.html

#6

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.