Example 1
Question: If \( p \) and \( q \) are distinct integers, prove that \( (p - q) \) is a factor of \( p^n - q^n \) for every positive integer \( n \). (Hint: Write \( p = (p - q) + q \) and expand \( p^n \) using the Binomial Theorem.)
Solution: We wish to prove that \( (p - q) \) divides \( p^n - q^n \) for every positive integer \( n \), where \( p \) and \( q \) are distinct integers. Write \( p = (p - q) + q \). Then: \[p^n = \left[(p - q) + q\right]^n\] Expanding using the Binomial Theorem: \[p^n = \sum_{r=0}^{n} \binom{n}{r} (p - q)^{n-r} \cdot q^{r}\] Separating the last term (where \( r = n \)): \[p^n = \sum_{r=0}^{n-1} \binom{n}{r} (p - q)^{n-r} \cdot q^{r} + q^n\] Subtracting \( q^n \) from both sides: \[p^n - q^n = \sum_{r=0}^{n-1} \binom{n}{r} (p - q)^{n-r} \cdot q^{r}\] Notice that in every term of the sum, the exponent of \( (p - q) \) is \( n - r \). Since \( r \) ranges from \( 0 \) to \( n - 1 \), we have \( n - r \ge 1 \) for all terms. Therefore, each term contains at least one factor of \( (p - q) \). Factoring out \( (p - q) \): \[p^n - q^n = (p - q) \sum_{r=0}^{n-1} \binom{n}{r} (p - q)^{n-r-1} \cdot q^{r}\] Since \( p \) and \( q \) are integers, \( \displaystyle\sum_{r=0}^{n-1} \binom{n}{r} (p - q)^{n-r-1} q^{r} \) is an integer. Therefore, \( (p - q) \) is a factor of \( p^n - q^n \) for every positive integer \( n \). Hence proved.
Answer: (p - q) is a factor of p^n - q^n for every positive integer n.
Example 2
Question: Using the Binomial Theorem, prove that for any two distinct integers \( x \) and \( y \), the expression \( (x + y) \) is a factor of \( x^{2m+1} + y^{2m+1} \) for every non-negative integer \( m \). (Hint: Write \( x = (x + y) - y \) and expand \( x^{2m+1} \) using the Binomial Theorem.)
Solution: Let \( n = 2m + 1 \) where \( m \) is a non-negative integer, so \( n \) is a positive odd integer. We wish to show \( (x + y) \) divides \( x^n + y^n \). Write \( x = (x + y) - y \). Then: \[x^n = \left[(x + y) - y\right]^n\] Expanding using the Binomial Theorem: \[x^n = \sum_{r=0}^{n} \binom{n}{r} (x + y)^{n-r} (-y)^{r}\] Separating the last term (where \( r = n \)): \[x^n = \sum_{r=0}^{n-1} \binom{n}{r} (x + y)^{n-r} (-y)^{r} + (-y)^n\] Since \( n = 2m + 1 \) is odd, \( (-y)^n = -y^n \). So: \[x^n = \sum_{r=0}^{n-1} \binom{n}{r} (x + y)^{n-r} (-y)^{r} - y^n\] Adding \( y^n \) to both sides: \[x^n + y^n = \sum_{r=0}^{n-1} \binom{n}{r} (x + y)^{n-r} (-y)^{r}\] In every term of this sum, since \( r \) ranges from \( 0 \) to \( n - 1 \), the exponent of \( (x + y) \) is \( n - r \ge 1 \). Therefore each term contains at least one factor of \( (x + y) \). Factoring out \( (x + y) \): \[x^n + y^n = (x + y) \sum_{r=0}^{n-1} \binom{n}{r} (x + y)^{n-r-1} (-y)^{r}\] Since \( x \) and \( y \) are integers, the remaining sum is an integer. Therefore, \( (x + y) \) is a factor of \( x^{2m+1} + y^{2m+1} \) for every non-negative integer \( m \). Hence proved.
Answer: (x + y) is a factor of x^(2m+1) + y^(2m+1) for every non-negative integer m.