Difference between revisions of "1964 IMO Problems/Problem 1"

(Problem)
(One intermediate revision by one other user not shown)
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>.
+
== See Also ==
 +
{{IMO box|year=1964|before=First question|num-a=2}}

Revision as of 12:45, 29 January 2021

Problem

(a) Find all positive integers $n$ for which $2^n-1$ is divisible by $7$.

(b) Prove that there is no positive integer $n$ for which $2^n+1$ is divisible by $7$.

Solution

We see that $2^n$ is equivalent to $2, 4,$ and $1$ $\pmod{7}$ for $n$ congruent to $1$, $2$, and $0$ $\pmod{3}$, respectively.

(a) From the statement above, only $n$ divisible by $3$ work.

(b) Again from the statement above, $2^n$ can never be congruent to $-1$ $\pmod{7}$, so there are no solutions for $n$.

See Also

1964 IMO (Problems) • Resources
Preceded by
First question
1 2 3 4 5 6 Followed by
Problem 2
All IMO Problems and Solutions