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.(adsbygoogle = window.adsbygoogle || []).push({});

How can I show B=1 (mod m ) or B = -1(mod m)?

**Physics Forums - The Fusion of Science and Community**

# Question from the proof in euler's forumla

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

Have something to add?

- Similar discussions for: Question from the proof in euler's forumla

Loading...

**Physics Forums - The Fusion of Science and Community**