Difference between revisions of "2012 AIME II Problems/Problem 1"
(→Solution 2) |
(→Solution 2) |
||
Line 11: | Line 11: | ||
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>. Solving for <math>n</math> gives <math>n \equiv 1 \pmod 5</math>. The solutions are the numbers <math>n | ||
− | = 1, 6, 11, ... , 166</math>. There are <math>\boxed{ | + | = 1, 6, 11, ... , 166</math>. There are <math>\boxed{034}</math> solutions. |
== See Also == | == See Also == |
Revision as of 22:04, 28 February 2018
Contents
[hide]Problem 1
Find the number of ordered pairs of positive integer solutions to the equation .
Solution
Solution 1
Solving for gives us so in order for to be an integer, we must have The smallest possible value of is obviously and the greatest is so the total number of solutions is
Solution 2
Dividing by gives us . Solving for gives . The solutions are the numbers . There are solutions.
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.