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 "2012 AIME II Problems/Problem 1"

(→‎Solution 2)
m (→‎Solution 4 (Designed to be very quick))
(12 intermediate revisions by 7 users not shown)
Line 6: Line 6:
 
==Solution 1==
 
==Solution 1==
  
−
Solving for <math>m</math> gives us <math>m = \frac{503-3n}{5},</math> so in order for <math>m</math> to be an integer, we must have <math>3n \equiv 503 \mod 5 \longrightarrow n \equiv 1 \mod 5.</math> The smallest possible value of <math>n</math> is obviously <math>1,</math> and the greatest is <math>\frac{503 - 5}{3} = 166,</math> so the total number of solutions is <math>\frac{166-1}{5}+1 = \boxed{034}</math>
+
Solving for <math>m</math> gives us <math>m = \frac{503-3n}{5},</math> so in order for <math>m</math> to be an integer, we must have <math>3n \equiv 503 \mod 5 \longrightarrow n \equiv 1 \mod 5.</math> The smallest possible value of <math>n</math> is obviously <math>1,</math> and the greatest is <math>\frac{503 - 5}{3} = 166,</math> so the total number of solutions is <math>\frac{166-1}{5}+1 = \boxed{34}</math>
  
 
==Solution 2==
 
==Solution 2==
  
−
Dividing by <math>4</math> gives us <math>5m + 3n = 503</math>. Solving for <math>n</math> gives <math>n \equiv 1 \pmod 5</math>. The solutions are the numbers <math>n  
+
Dividing by <math>4</math> gives us <math>5m + 3n = 503</math>. Thus, we have <math>503-5m\equiv 0 \pmod 3</math> since <math>n</math> is an integer. Rearranging then gives <math>m\equiv 1\pmod 3.</math> Since <math>503-5m>0,</math> we know that <math>m<503/5.</math> Because <math>m</math> is an integer, we can rewrite this as <math>m\le 100.</math> Therefore, <math>m</math> ranges from
−
= 1, 6, 11, ... , 166</math>. There are <math>\boxed{34}</math> solutions.
+
<cmath>0\cdot 3+1\quad \text{to} \quad 33\cdot 3+1,</cmath>
 +
giving <math>\boxed{034}</math> values.
 +
~vaporwave
 +
 
 +
==Solution 3==
 +
 
 +
Because the x-intercept of the equation is <math>\frac{2012}{20}</math>, and the y-intercept is <math>\frac{2012}{12}</math>, the slope is <math>\frac{\frac{-2012}{12}}{\frac{2012}{20}} = \frac{-5}{3}</math>. Now, notice the first obvious solution: (100,1). From it, we derive all the other solutions by applying the slope in reverse, i.e: <math>(100,1), (97,6), (94,11)...</math> Because the solutions are only positive, we can generate only 33 more solutions, so in total we have <math>33+1=\boxed{34}</math> solutions.
 +
 
 +
== Solution 4 (Quick)==
 +
Note that a positive integer is divisible by 20 if it ends in 0.
 +
 
 +
Notice that if a multiple of 12 end in 2, 12 must be multiplied by an integer that ends in 1 or 6.
 +
 
 +
So let's start checking because 2012 ends in 2, same as 12.
 +
 
 +
When <math>n=1</math>, <math>m=100</math>.
 +
 
 +
When <math>n=6</math>, <math>m=97</math>.
 +
What is happening? Why doesn't, say, as values of <math>n</math>, do <math>1, 11, ...</math> work, while <math>6, 16, 26</math> work for <math>m</math> to be an integer (as seen in 2022 CEMC Cayley #21 (https://www.cemc.uwaterloo.ca/contests/past_contests/2022/2022CayleyContest.pdf,
 +
https://www.cemc.uwaterloo.ca/contests/past_contests/2022/2022CayleySolution.pdf)?)
 +
 
 +
Notice that we can break <math>1, 6, ...</math> down into <math>0, 5, 10, ...</math>. So <math>20m=2000-12k</math>, where <math>k</math> is a member of the set <math>{0, 5, 10, 15...}</math>.
 +
 
 +
For a number to be divisible by 20, it must be divisible 10, and the quotient (that number divided by 10) must be divisible by 2. This means that the number must end in 0, and its tens digit must be even.
 +
 
 +
So notice that the tens digit cycle in: <math>0, 4, 8, 2, 6</math>. Each of this is even (notice that when <math>k=25</math>, <math>2000-12k=1700</math>, it cycles again).
 +
 
 +
So we know that all values of <math>n</math>, which end in 1 or 6, that make <math>2012-12n\geq20</math> works.
 +
 
 +
So values of <math>n</math> that belong to <math>{1, 6, ..., 166}</math> work. Clearly, that is 34 integer values of <math>n</math>. Therefore, the answer is <math>\boxed{034}</math>.
 +
 
 +
~hastapasta
  
 
== See Also ==
 
== See Also ==

Revision as of 13:56, 2 June 2023

Problem 1

Find the number of ordered pairs of positive integer solutions $(m, n)$ to the equation $20m + 12n = 2012$.

Solution

Solution 1

Solving for $m$ gives us $m = \frac{503-3n}{5},$ so in order for $m$ to be an integer, we must have $3n \equiv 503 \mod 5 \longrightarrow n \equiv 1 \mod 5.$ The smallest possible value of $n$ is obviously $1,$ and the greatest is $\frac{503 - 5}{3} = 166,$ so the total number of solutions is $\frac{166-1}{5}+1 = \boxed{34}$

Solution 2

Dividing by $4$ gives us $5m + 3n = 503$. Thus, we have $503-5m\equiv 0 \pmod 3$ since $n$ is an integer. Rearranging then gives $m\equiv 1\pmod 3.$ Since $503-5m>0,$ we know that $m<503/5.$ Because $m$ is an integer, we can rewrite this as $m\le 100.$ Therefore, $m$ ranges from \[0\cdot 3+1\quad \text{to} \quad 33\cdot 3+1,\] giving $\boxed{034}$ values. ~vaporwave

Solution 3

Because the x-intercept of the equation is $\frac{2012}{20}$, and the y-intercept is $\frac{2012}{12}$, the slope is $\frac{\frac{-2012}{12}}{\frac{2012}{20}} = \frac{-5}{3}$. Now, notice the first obvious solution: (100,1). From it, we derive all the other solutions by applying the slope in reverse, i.e: $(100,1), (97,6), (94,11)...$ Because the solutions are only positive, we can generate only 33 more solutions, so in total we have $33+1=\boxed{34}$ solutions.

Solution 4 (Quick)

Note that a positive integer is divisible by 20 if it ends in 0.

Notice that if a multiple of 12 end in 2, 12 must be multiplied by an integer that ends in 1 or 6.

So let's start checking because 2012 ends in 2, same as 12.

When $n=1$, $m=100$.

When $n=6$, $m=97$. What is happening? Why doesn't, say, as values of $n$, do $1, 11, ...$ work, while $6, 16, 26$ work for $m$ to be an integer (as seen in 2022 CEMC Cayley #21 (https://www.cemc.uwaterloo.ca/contests/past_contests/2022/2022CayleyContest.pdf, https://www.cemc.uwaterloo.ca/contests/past_contests/2022/2022CayleySolution.pdf)?)

Notice that we can break $1, 6, ...$ down into $0, 5, 10, ...$. So $20m=2000-12k$, where $k$ is a member of the set ${0, 5, 10, 15...}$.

For a number to be divisible by 20, it must be divisible 10, and the quotient (that number divided by 10) must be divisible by 2. This means that the number must end in 0, and its tens digit must be even.

So notice that the tens digit cycle in: $0, 4, 8, 2, 6$. Each of this is even (notice that when $k=25$, $2000-12k=1700$, it cycles again).

So we know that all values of $n$, which end in 1 or 6, that make $2012-12n\geq20$ works.

So values of $n$ that belong to ${1, 6, ..., 166}$ work. Clearly, that is 34 integer values of $n$. Therefore, the answer is $\boxed{034}$.

~hastapasta

See Also

2012 AIME II (Problems • Answer Key • Resources)
Preceded by
First Problem 		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=2012_AIME_II_Problems/Problem_1&oldid=193820"