Let b1 < b2 < … < bφ(m) be the integers between 1 and m that are relatively prime to m (including 1), and let B = b1b2b3 • • • bφ(m) be their product. The quantity B came up during the proof of Euler’s formula.
(a) Show that either B ≡ 1 (mod m) or B ≡ ─1 (mod m).
(b) Compute B for some small values of m and try to find a pattern for when it is equal to +1 (mod m) and when it is equal to ─1 (mod m).
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.