Difference between revisions of "2013 AMC 12B Problems/Problem 15"
(→Solution) |
m (→See also) |
||
Line 12: | Line 12: | ||
{{AMC12 box|year=2013|ab=B|num-b=14|num-a=16}} | {{AMC12 box|year=2013|ab=B|num-b=14|num-a=16}} | ||
+ | {{AMC10 box|year=2013|ab=B|num-b=19|num-a=21}} | ||
[[Category:Introductory Number Theory Problems]] | [[Category:Introductory Number Theory Problems]] | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 12:39, 2 January 2015
- The following problem is from both the 2013 AMC 12B #15 and 2013 AMC 10B #20, so both problems redirect to this page.
Problem
The number is expressed in the form
![$2013 = \frac {a_1!a_2!...a_m!}{b_1!b_2!...b_n!}$](http://latex.artofproblemsolving.com/6/6/9/6690a904c827dd9d3643929e24f32e7eea1074e5.png)
where and
are positive integers and
is as small as possible. What is
?
Solution
The prime factorization of is
. To have a factor of
in the numerator and to minimize
must equal
. Now we notice that there can be no prime
which is not a factor of 2013 such that
because this prime will not be represented in the denominator, but will be represented in the numerator. The highest
less than
is
, so there must be a factor of
in the denominator. It follows that
(to minimize
as well), so the answer is
. One possible way to express
with
is
See also
2013 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 14 |
Followed by Problem 16 |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
All AMC 12 Problems and Solutions |
2013 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 19 |
Followed by Problem 21 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AMC 10 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.