Difference between revisions of "1964 IMO Problems/Problem 1"
(→Problem) |
(→Solution) |
||
Line 5: | Line 5: | ||
== Solution == | == Solution == | ||
+ | |||
We see that <math>2^n</math> is equivalent to <math>2, 4,</math> and <math>1</math> <math>\pmod{7}</math> for <math>n</math> congruent to <math>1</math>, <math>2</math>, and <math>0</math> <math>\pmod{3}</math>, respectively. | We see that <math>2^n</math> is equivalent to <math>2, 4,</math> and <math>1</math> <math>\pmod{7}</math> for <math>n</math> congruent to <math>1</math>, <math>2</math>, and <math>0</math> <math>\pmod{3}</math>, respectively. | ||
− | (a) From the statement above, only <math>n</math> divisible by <math>3</math> work. | + | '''(a)''' From the statement above, only <math>n</math> divisible by <math>3</math> work. |
− | (b) Again from the statement above, <math>2^n</math> can never be congruent to <math>-1</math> <math>\pmod{7}</math>, so there are no solutions for <math>n</math>. | + | '''(b)''' Again from the statement above, <math>2^n</math> can never be congruent to <math>-1</math> <math>\pmod{7}</math>, so there are no solutions for <math>n</math>. |
Revision as of 22:04, 16 August 2013
Problem
(a) Find all positive integers for which is divisible by .
(b) Prove that there is no positive integer for which is divisible by .
Solution
We see that is equivalent to and for congruent to , , and , respectively.
(a) From the statement above, only divisible by work.
(b) Again from the statement above, can never be congruent to , so there are no solutions for .