Difference between revisions of "2003 AIME I Problems/Problem 1"

m (See also: o_o)
Line 17: Line 17:
  
 
[[Category:Introductory Number Theory Problems]]
 
[[Category:Introductory Number Theory Problems]]
 +
{{MAA Notice}}

Revision as of 19:57, 4 July 2013

Problem

Given that

$\frac{((3!)!)!}{3!} = k \cdot n!,$

where $k$ and $n$ are positive integers and $n$ is as large as possible, find $k + n.$

Solution

We use the definition of a factorial to get

$\frac{((3!)!)!}{3!} = \frac{(6!)!}{3!} = \frac{720!}{3!} = \frac{720!}{6} = \frac{720 \cdot 719!}{6} = 120 \cdot 719! = k \cdot n!$

We certainly can't make $n$ any larger if $k$ is going to stay an integer, so the answer is $k + n = 120 + 719 = \boxed{839}$.

See also

2003 AIME I (ProblemsAnswer KeyResources)
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