Mock AIME 2 2006-2007 Problems/Problem 1
Revision as of 14:27, 3 April 2012 by 1=2 (talk | contribs) (moved Mock AIME 2 2006-2007/Problem 1 to Mock AIME 2 2006-2007 Problems/Problem 1: correcting title)
Problem
A positive integer is called a dragon if it can be written as the sum of four positive integers and such that Find the smallest dragon.
Solution
From we have that 16 divides . From we have . Minimizing minimizes and and consequently minimizes our dragon. The smallest possible choice is , from which and so our desired number is .