Scribd
Upload
67 views1 page

USA Mathematical Talent Search Solutions To Problem 4/3/19: 0 1 2 3 4 4k 4k+1 4k+2 4k+3

1) The document is about proving that the number 101 divides infinitely many numbers in the set {2007, 20072007, 200720072007, 2007200720072007, ...}. 2) The solution reduces each element of the set modulo 101 to a simple formula. 3) It is shown that for positive multiples n of 101, the formula 88n is equivalent to 0 modulo 101, proving that 101 divides infinitely many numbers in the set.

Uploaded by

สฮาบูดีน สาและ
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
67 views1 page

USA Mathematical Talent Search Solutions To Problem 4/3/19: 0 1 2 3 4 4k 4k+1 4k+2 4k+3

1) The document is about proving that the number 101 divides infinitely many numbers in the set {2007, 20072007, 200720072007, 2007200720072007, ...}. 2) The solution reduces each element of the set modulo 101 to a simple formula. 3) It is shown that for positive multiples n of 101, the formula 88n is equivalent to 0 modulo 101, proving that 101 divides infinitely many numbers in the set.

Uploaded by

สฮาบูดีน สาและ
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

USA Mathematical Talent Search

Solutions to Problem 4/3/19


www.usamts.org

4/3/19. Prove that 101 divides infinitely many of the numbers in the set

{2007, 20072007, 200720072007, 2007200720072007, . . .}.

Comments There are several possible approaches, but the following solution elegantly
reduces the elements of the set modulo 101 to a simple formula. Solutions edited by Naoki
Sato.

Solution by: Daniel Tsai (12/NJ)


Create PDF with GO2PDF for free, if you wish to remove this line, click here to buy Virtual PDF Printer
Modulo 101, we have 100 1, 101 10, 102 100, 103 91, and 104 1. Therefore,
modulo 101, for each integer k 0, 104k 1, 104k+1 10, 104k+2 100, and 104k+3 91.
Consequently, for each positive integer n,

20072007 2007 (2 91 + 0 100 + 0 10 + 7 1)n 189n 88n (mod 101),

where the left-hand-side consists of n 2007s. For each positive multiple n of 101, 88n 0
(mod 101), thus 101 divides infinitely many numbers in the set

{2007, 20072007, 200720072007, 2007200720072007, . . . }.

You might also like