Difference between revisions of "Mock AIME 2 2006-2007 Problems/Problem 1"

Revision as of 14:27, 3 April 2012

Problem

A positive integer is called a dragon if it can be written as the sum of four positive integers $\displaystyle a,b,c,$ and $\displaystyle d$ such that $\displaystyle a+4=b-4=4c=d/4.$ Find the smallest dragon.

Solution

From $4c = \frac{d}4$ we have that 16 divides $d$ . From $a + 4 = \frac d4$ we have $d \geq 20$ . Minimizing $d$ minimizes $a, b$ and $c$ and consequently minimizes our dragon. The smallest possible choice is $d = 32$ , from which $a = 4, b = 12$ and $c = 2$ so our desired number is $a + b + c + d = 4 + 12 + 2 + 32 = 050$ .

Next Problem

Mock AIME 2 2006-2007

Page

Toolbox

Search

Difference between revisions of "Mock AIME 2 2006-2007 Problems/Problem 1"

Revision as of 14:27, 3 April 2012

Problem

Solution

Revision as of 19:22, 15 September 2006 (view source) JBL (talk \| contribs) m (categorized) ← Older edit	Revision as of 14:27, 3 April 2012 (view source) 1=2 (talk \| contribs) m (moved Mock AIME 2 2006-2007/Problem 1 to Mock AIME 2 2006-2007 Problems/Problem 1: correcting title) Newer edit →
(No difference)