- #1
RossH
- 75
- 0
Homework Statement
Let b1 through b_phi(m) be integers between 1 and m that are coprime to m. Let B be the product of these integers. Show that B must be congruent to 1 or -1 (mod m)
Homework Equations
None.
The Attempt at a Solution
Well, I know that the quantity B appears during the proof of Euler's formula. That is, that a^phi(m) is congruent to 1 (mod m). So I probably have to work from there somehow. I have looked at Wilson's theorem, Euler's theorem, and Fermat's little Theorem. I'm not really sure where to go from here.