2025 AMC 12A Problems/Problem 18: Difference between revisions
Silverrush (talk | contribs) m →Solution 2: another latex fix last one i promise |
Silverrush (talk | contribs) m →Solution 2: rearranged text to make more sense |
||
| Line 19: | Line 19: | ||
total = 11 + 10 +6 +3 +1 = 31. permutate x, y, z for ordered triple, it is 31*6=186, C. | total = 11 + 10 +6 +3 +1 = 31. permutate x, y, z for ordered triple, it is 31*6=186, C. | ||
==Solution 2== | ==Solution 2== | ||
For now, assume <imath>x\leq y\leq z</imath>. | For now, assume <imath>x\leq y\leq z</imath>. | ||
First note that no number can be 0, as it would imply <imath>0y>z</imath>. Similarly, no number can be 1, as it would imply <imath>1y>z</imath>. So we only need to consider numbers between 2 and 8, inclusive. | First note that no number can be 0, as it would imply <imath>0y>z</imath>. Similarly, no number can be 1, as it would imply <imath>1y>z</imath>. So we only need to consider numbers between 2 and 8, inclusive. | ||
We may use complementary counting: | |||
Consider when <imath>xy\leq z</imath>. This implies <imath>xy\leq 8</imath>. Some quick calculations gives us the products <imath>2\cdot2,2\cdot3,2\cdot4</imath>. We may now calculate the number of times each happens (we are no longer assuming <imath>x\leq y\leq z</imath>): | Consider when <imath>xy\leq z</imath>. This implies <imath>xy\leq 8</imath>. Some quick calculations gives us the products <imath>2\cdot2,2\cdot3,2\cdot4</imath>. We may now calculate the number of times each happens (we are no longer assuming <imath>x\leq y\leq z</imath>): | ||
Revision as of 17:30, 6 November 2025
Problem 19
How many ordered triples
of different positive integers less than or equal to
satisfy
,
, and
?
Solution 1
let 0<=x<y<z<=8; x cannot be 0 because it makes xy>z --> 0>z; x cannot be 1 because it makes xy>z ---> y>z;
x=2, y=3, z can be 4, 5 but not others; x=2, y=4, z can be 5, 6, 7; x=2, y=5, z can be 6, 7, 8; x=2, y=6, z can be 7, 8; x=2, y=7, z can be 8; for x=2, total 11 cases;
similarly, for x=3,y=4, 5, 6, 7, total 10 cases; for x=4, y =5, 6, 7, total 6 cases; x=5, y=6, 7, 3 cases; x=6, y=7, z=8, 1 cases;
total = 11 + 10 +6 +3 +1 = 31. permutate x, y, z for ordered triple, it is 31*6=186, C.
Solution 2
For now, assume
.
First note that no number can be 0, as it would imply
. Similarly, no number can be 1, as it would imply
. So we only need to consider numbers between 2 and 8, inclusive.
We may use complementary counting:
Consider when
. This implies
. Some quick calculations gives us the products
. We may now calculate the number of times each happens (we are no longer assuming
):
: This case is invalid as it asks for distinct integers.
:
. Then we have
cases.
:
. Then we have
cases.
In total, there are
total cases, so our final answer is
.
~SilverRush