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>....") |
m |
||
(One intermediate revision by one other user not shown) | |||
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. | ||
+ | |||
+ | == See also == | ||
+ | {{AHSME box|year=1989|num-b=10|num-a=12}} | ||
+ | |||
+ | [[Category: Introductory Algebra Problems]] | ||
+ | {{MAA Notice}} |
Latest revision as of 06:49, 22 October 2014
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.
See also
1989 AHSME (Problems • Answer Key • Resources) | ||
Preceded by Problem 10 |
Followed by Problem 12 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30 | ||
All AHSME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.