Difference between revisions of "1971 Canadian MO Problems/Problem 6"
Airplanes1 (talk | contribs) (Created page with "== Problem == Show that, for all integers <math>n</math>, <math>n^2+2n+12</math> is not a multiple of <math>121</math>. == Solution == <math>n^2 + 2n + 12 = (n+1)^2 + 11</math...") |
Airplanes1 (talk | contribs) |
||
Line 5: | Line 5: | ||
<math>n^2 + 2n + 12 = (n+1)^2 + 11</math>. Consider this equation mod 11. <math> (n+1)^2 + 11 \equiv (n+1)^2 \mod 11</math>. | <math>n^2 + 2n + 12 = (n+1)^2 + 11</math>. Consider this equation mod 11. <math> (n+1)^2 + 11 \equiv (n+1)^2 \mod 11</math>. | ||
+ | The quadratic residues mod 11 are 1, 3, 4, 5, 9, and 0 (as shown below). | ||
If <math>n \equiv 0 \mod 11</math>, <math>(n+1)^2 \equiv (0+1)^2 \equiv 1\mod 11</math>, thus not a multiple of 11, nor 121. | If <math>n \equiv 0 \mod 11</math>, <math>(n+1)^2 \equiv (0+1)^2 \equiv 1\mod 11</math>, thus not a multiple of 11, nor 121. | ||
Line 26: | Line 27: | ||
If <math>n \equiv 9 \mod 11</math>, <math>(n+1)^2 \equiv (9+1)^2 \equiv 1\mod 11</math>, thus not a multiple of 11, nor 121. | If <math>n \equiv 9 \mod 11</math>, <math>(n+1)^2 \equiv (9+1)^2 \equiv 1\mod 11</math>, thus not a multiple of 11, nor 121. | ||
+ | |||
If <math>n \equiv 10 \mod 11</math>, <math>(n+1)^2 \equiv (10+1)^2 \equiv 121 \mod 11</math>, thus a multiple of 11. However, considering the equation <math>\mod 121</math>, <math>(n+1)^2 + 11 \equiv (10+1)^2 + 11 \equiv 121+ 11 \equiv 132 \equiv 11 \mod 121</math>, thus not a multiple of 121, even though it is a multiple of 11. | If <math>n \equiv 10 \mod 11</math>, <math>(n+1)^2 \equiv (10+1)^2 \equiv 121 \mod 11</math>, thus a multiple of 11. However, considering the equation <math>\mod 121</math>, <math>(n+1)^2 + 11 \equiv (10+1)^2 + 11 \equiv 121+ 11 \equiv 132 \equiv 11 \mod 121</math>, thus not a multiple of 121, even though it is a multiple of 11. | ||
Revision as of 21:06, 14 December 2011
Problem
Show that, for all integers , is not a multiple of .
Solution
. Consider this equation mod 11. . The quadratic residues mod 11 are 1, 3, 4, 5, 9, and 0 (as shown below).
If , , thus not a multiple of 11, nor 121.
If , , thus not a multiple of 11, nor 121.
If , , thus not a multiple of 11, nor 121.
If , , thus not a multiple of 11, nor 121.
If , , thus not a multiple of 11, nor 121.
If , , thus not a multiple of 11, nor 121.
If , , thus not a multiple of 11, nor 121.
If , , thus not a multiple of 11, nor 121.
If , , thus not a multiple of 11, nor 121.
If , , thus not a multiple of 11, nor 121.
If , , thus a multiple of 11. However, considering the equation , , thus not a multiple of 121, even though it is a multiple of 11.
Thus, for any integer , is not a multiple of .
1971 Canadian MO (Problems) | ||
Preceded by Problem 5 |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • | Followed by Problem 7 |