Problem 9 Number Theory

  • November 2019
  • PDF

This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form. Report DMCA


Overview

Download & View Problem 9 Number Theory as PDF for free.

More details

  • Words: 140
  • Pages: 1
Problem 9: Number Theory

Art of Problem Solving

Problem: Find the remainder when 20062007 is divided by 2008. Solution: We want to find 20062007 (mod 2008). Note that: x ≡ 20062007 ≡ (−2)2007

(mod 2008)

Also note that 2008 = 251 · 8, so we can break this down into two cases that are easy to calculate: x ≡ (−2)2007 ≡ 0

(mod 8)

x ≡ (−2)2007 ≡ −128 ≡ 123

(mod 251)

From the first equivalence, we see that x is of the form 8k for some integer k. We can substitute this into the second equivalence and solve: 8k ≡ 123

(mod 251)

k ≡ 235

(mod 251)

We found x to be of the form 8k, so x = 8(235) = 1880 .

Solution was written by Sean Soni and compiled from Art of Problem Solving Forums.

Related Documents

Problem 9 Number Theory
November 2019 16
Problem 4 Number Theory
November 2019 11
Number Theory
May 2020 18
Number Theory
May 2020 21
Number Theory
November 2019 28
Number 9
June 2020 8