1987 AJHSME Problems/Problem 6
From AoPSWiki
Problem
The smallest product one could obtain by multiplying two numbers in the set
is
Solution
To get the smallest possible product, we want to multiply the smallest negative number by the largest positive number. These are
and
, respectively, and their product is
, which is
See Also
| 1987 AJHSME (Problems • Resources) | ||
| Preceded by Problem 5 | Followed by Problem 7 | |
| 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 | ||





