Back to Combinatorial Proofs

Exercise 10

Avg difficulty 2.5

In each polynomial below, assume xx is some variable. Use the binomial theorem to expand and reduce modulo the appropriate number:

  1. (x+1)2(mod2)(x+1)^2 \pmod 2
  2. (x+1)5(mod5)(x+1)^5 \pmod 5
  3. (x+1)7(mod7)(x+1)^7 \pmod 7

Prove that (x+1)p≡xp+1(modp)(x+1)^p \equiv x^p + 1 \pmod p for any prime pp.

Hammond, Discrete Math for Shockers, §5.3 Combinatorial Proofs, Exercise 10

AI Tutor

Adapted from Discrete Math for Shockers © 2021 John Hammond. Licensed under CC BY-SA 4.0. Source: Discrete Math for Shockers. Imported at revision 2538beb.