Difference between revisions of "2003 AIME I Problems/Problem 1"
(Added problem and solution) |
|||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| + | Given that | ||
| + | |||
| + | <math> \frac{((3!)!)!}{3!} = k \cdot n!, </math> | ||
| + | |||
| + | where <math> k </math> and <math> n </math> are positive integers and <math> n </math> is as large as possible, find <math> k + n. </math> | ||
== Solution == | == Solution == | ||
| + | <math> \frac{((3!)!)!}{3!} = \frac{(6!)!}{3!} = \frac{720!}{3!} = \frac{720!}{6} = \frac{720 \cdot 719!}{6} = 120 \cdot 719! = k \cdot n! </math> | ||
| + | |||
| + | Therefore: <math> k + n = 120 + 719 = 839 </math> | ||
== See also == | == See also == | ||
* [[2003 AIME I Problems]] | * [[2003 AIME I Problems]] | ||
Revision as of 18:45, 15 July 2006
Problem
Given that
where 
and 
are positive integers and is as large as possible, find 
Solution
Therefore: 
