Difference between revisions of "1989 AHSME Problems/Problem 11"
(Created page with "== Problem == Let <math>a</math>, <math>b</math>, <math>c</math>, and <math>d</math> be positive integers with <math> a < 2b</math>, <math>b < 3c </math>, and <math>c<4d</math>....") |
|||
| Line 15: | Line 15: | ||
Note that the statement <math>a<2b<6c<24d<2400</math> is true, but does not specify the distances between each pair of values. | Note that the statement <math>a<2b<6c<24d<2400</math> is true, but does not specify the distances between each pair of values. | ||
| + | {{MAA Notice}} | ||
Revision as of 12:48, 5 July 2013
Problem
Let
,
,
, and
be positive integers with
,
, and
. If
, the largest possible value for
is
Solution
Each of these integers is bounded above by the next one.
, so the maximum
is
.
, so the maximum
is
.
, so the maximum
is
.
, so the maximum
is
.
Note that the statement
is true, but does not specify the distances between each pair of values.
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions.