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 "2004 AIME I Problems/Problem 1"

(→‎Solution 2)
(→‎Solution 2)
 
(13 intermediate revisions by 6 users not shown)
Line 2: Line 2:
 
The digits of a positive integer <math> n </math> are four consecutive integers in decreasing order when read from left to right. What is the sum of the possible remainders when <math> n </math> is divided by <math>37</math>?
 
The digits of a positive integer <math> n </math> are four consecutive integers in decreasing order when read from left to right. What is the sum of the possible remainders when <math> n </math> is divided by <math>37</math>?
  
−
== Solution ==
+
== Solution 1==
 
A brute-force solution to this question is fairly quick, but we'll try something slightly more clever:  our numbers have the form <math>{\underline{(n+3)}}\,{\underline{(n+2)}}\,{\underline{( n+1)}}\,{\underline {(n)}} </math><math>= 1000(n + 3) + 100(n + 2) + 10(n + 1) + n = 3210 + 1111n</math>, for <math>n \in \lbrace0, 1, 2, 3, 4, 5, 6\rbrace</math>.
 
A brute-force solution to this question is fairly quick, but we'll try something slightly more clever:  our numbers have the form <math>{\underline{(n+3)}}\,{\underline{(n+2)}}\,{\underline{( n+1)}}\,{\underline {(n)}} </math><math>= 1000(n + 3) + 100(n + 2) + 10(n + 1) + n = 3210 + 1111n</math>, for <math>n \in \lbrace0, 1, 2, 3, 4, 5, 6\rbrace</math>.
  
 
Now, note that <math>3\cdot 37 = 111</math> so <math>30 \cdot 37 = 1110</math>, and <math>90 \cdot 37 = 3330</math> so <math>87 \cdot 37 = 3219</math>. So the [[remainder]]s are all congruent to <math>n - 9 \pmod{37}</math>. However, these numbers are negative for our choices of <math>n</math>, so in fact the remainders must equal <math>n + 28</math>.
 
Now, note that <math>3\cdot 37 = 111</math> so <math>30 \cdot 37 = 1110</math>, and <math>90 \cdot 37 = 3330</math> so <math>87 \cdot 37 = 3219</math>. So the [[remainder]]s are all congruent to <math>n - 9 \pmod{37}</math>. However, these numbers are negative for our choices of <math>n</math>, so in fact the remainders must equal <math>n + 28</math>.
  
−
Adding these numbers up, we get <math>(0 + 1 + 2 + 3 + 4 + 5 + 6) + 7\cdot28 = \boxed{217}</math>, our answer.
+
Adding these numbers up, we get <math>(0 + 1 + 2 + 3 + 4 + 5 + 6) + 7\cdot28 = \boxed{217}</math>
  
 +
== Solution 2==
 +
There are only <math>7</math> possible values of <math>n</math>: <math>3210, 4321, 5432, \cdots, 9876</math>.
  
−
==Solution 2 ==
+
<math>3210</math> gives a remainder of <math>28</math> when divided by <math>37</math>. To calculate the remainders of the other integers, notice that each number is <math>1111</math> more than the previous number. Since <math>1111</math> gives a remainder of <math>1</math> when divided by <math>37</math>, the remainders of the other integers will be <math>29, 30, 31, \cdots, 34</math>.
  
−
For any n we are told that it is four consecutive integers in decreasing order when read from left to right. Thus for any number(<math>d</math>) <math>0-6</math>(<math>7-9</math> do not work because a digit cannot be greater than 9), <math>n</math> is equal to <math>(d)+10(d+1)+100(d+2)+1000(d+3)</math> or <math>1111d +3210</math>. Now we try this number for <math>d=0</math>. When <math>d=0</math>, <math>n=3210</math> and <math>3210</math> when divided by <math>37</math> has a remainder of 28. We now notice that every time you increase <math>d</math> by <math>1</math> you increase <math>n</math> by <math>1111</math> and <math>1111</math> has remainder <math>1</math> when divided by <math>37</math>. Thus, the remainder increases by <math>1</math> every time you increase <math>d</math> by <math>1</math>. Thus,
+
Therefore, our answer is <math>28 + 29 + 30 + 31 + 32 + 33 + 34 = \frac{28 + 34}{2} \cdot 7 = \boxed{217}</math>.
−
 
+
~Viliciri
−
When <math>d=0</math>, the remainder equals 28
 
−
 
 
−
When <math>d=1</math>, the remainder equals 29
 
−
 
 
−
When <math>d=2</math>, the remainder equals 30
 
−
 
 
−
When <math>d=3</math>, the remainder equals 31
 
−
 
 
−
When <math>d=4</math>, the remainder equals 32
 
−
 
 
−
When <math>d=5</math>, the remainder equals 33
 
−
 
 
−
When <math>d=6</math>, the remainder equals 34
 
−
 
 
−
 
 
−
Thus the sum of the remainders is equal to <math>28+29+30+31+32+33+34</math> which is equal to <math>217</math>.
 
−
 
 
−
==Solution 3(bashy)
 
−
 
 
−
Just divide every possible number(There are only 7) by 37 and add the resulting remainders.
 
  
 
== See also ==
 
== See also ==

Latest revision as of 22:56, 2 December 2024

Problem

The digits of a positive integer $n$ are four consecutive integers in decreasing order when read from left to right. What is the sum of the possible remainders when $n$ is divided by $37$?

Solution 1

A brute-force solution to this question is fairly quick, but we'll try something slightly more clever: our numbers have the form ${\underline{(n+3)}}\,{\underline{(n+2)}}\,{\underline{( n+1)}}\,{\underline {(n)}}$$= 1000(n + 3) + 100(n + 2) + 10(n + 1) + n = 3210 + 1111n$, for $n \in \lbrace0, 1, 2, 3, 4, 5, 6\rbrace$.

Now, note that $3\cdot 37 = 111$ so $30 \cdot 37 = 1110$, and $90 \cdot 37 = 3330$ so $87 \cdot 37 = 3219$. So the remainders are all congruent to $n - 9 \pmod{37}$. However, these numbers are negative for our choices of $n$, so in fact the remainders must equal $n + 28$.

Adding these numbers up, we get $(0 + 1 + 2 + 3 + 4 + 5 + 6) + 7\cdot28 = \boxed{217}$

Solution 2

There are only $7$ possible values of $n$: $3210, 4321, 5432, \cdots, 9876$.

$3210$ gives a remainder of $28$ when divided by $37$. To calculate the remainders of the other integers, notice that each number is $1111$ more than the previous number. Since $1111$ gives a remainder of $1$ when divided by $37$, the remainders of the other integers will be $29, 30, 31, \cdots, 34$.

Therefore, our answer is $28 + 29 + 30 + 31 + 32 + 33 + 34 = \frac{28 + 34}{2} \cdot 7 = \boxed{217}$. ~Viliciri

See also

2004 AIME I (Problems • Answer Key • Resources)
Preceded by
First Question 		Followed by
Problem 2
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2004_AIME_I_Problems/Problem_1&oldid=236086"