Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "1972 AHSME Problems/Problem 31"

(Created page and added solution)
 
m
Line 1: Line 1:
 +
== Problem ==
 
When the number <math>2^{1000}</math> is divided by <math>13</math>, the remainder in the division is
 
When the number <math>2^{1000}</math> is divided by <math>13</math>, the remainder in the division is
  

Revision as of 13:05, 23 June 2021

Problem

When the number $2^{1000}$ is divided by $13$, the remainder in the division is

$\textbf{(A) }1\qquad \textbf{(B) }2\qquad \textbf{(C) }3\qquad \textbf{(D) }7\qquad \textbf{(E) }11$

Solution

By Fermat's little theorem, we know that $2^{100} \equiv 2^{1000 \pmod{12}}\pmod{13}$. However, we find that $1000 \equiv 4 \pmod{12}$, so $2^{1000} \equiv 2^4 = 16 \equiv 3 \pmod{13}$, so the answer is $\boxed{\textbf{(C)}}$.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1972_AHSME_Problems/Problem_31&oldid=156677"