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

Revision as of 18:57, 4 July 2013

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.$

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}$ .

Revision as of 13:51, 10 June 2008 (view source) Azjps (talk \| contribs) m (→‎See also: o_o) ← Older edit		Revision as of 18:57, 4 July 2013 (view source) Nathan wailes (talk \| contribs) Newer edit →
Line 17:		Line 17:

	[[Category:Introductory Number Theory Problems]]		[[Category:Introductory Number Theory Problems]]
		+	{{MAA Notice}}

2003 AIME I (Problems • Answer Key • Resources)
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