- #1
lifom
- 14
- 0
Let b1,b2,...bn be the integers between 1 and m that are relative prime to m (including 1), and let B = b1*b2*...*bn be their product. The quantity B came up during the proof of euler formula. a^n = 1 (mod m), where n is number of integers between 1 and m that relative prime to m.
How can I show B=1 (mod m ) or B = -1(mod m)?
How can I show B=1 (mod m ) or B = -1(mod m)?