Mock AIME 2 2006-2007 Problems/Problem 1: Difference between revisions
No edit summary |
mNo edit summary |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
A positive integer is called a dragon if it can be [[partitioned]] into four positive integers <math>\displaystyle a,b,c,</math> and <math>\displaystyle d</math> such that <math>\displaystyle a+4=b-4=4c=d/4.</math> Find the smallest dragon. | A positive integer is called a dragon if it can be [[partitioned]] into four positive integers <math>\displaystyle a,b,c,</math> and <math>\displaystyle d</math> such that <math>\displaystyle a+4=b-4=4c=d/4.</math> Find the smallest dragon. | ||
==Solution== | |||
{{solution}} | |||
---- | |||
*[[Mock AIME 2 2006-2007/Problem 2 | Next Problem]] | |||
*[[Mock AIME 2 2006-2007]] | |||
Revision as of 18:45, 22 August 2006
Problem
A positive integer is called a dragon if it can be partitioned into four positive integers 
and 
such that 
Find the smallest dragon.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
