Given an odd number , let and let . For each , let be the remainder left by upon division by . Show that
, 2011
Solution
Since is odd, is even. Given an element of , write
and notice that
to get
Hence
Finally, notice that the product in the right-hand member is congruent to 1 modulo . To see this, let denote the modulo multiplicative inverse of an element of , and notice that
The first congruence shows that if belongs to , then so does , and the second shows that if and only if . Consequently, if , the factors and in the product can be paired off and the conclusion follows.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.