Difference between revisions of "2021 Fall AMC 10B Problems/Problem 23"
Isabelchen (talk | contribs) (→Solution 2 (Ramsey's Theorem)) |
Isabelchen (talk | contribs) (→Solution 2 (Ramsey's Theorem)) |
||
Line 30: | Line 30: | ||
[[File:K 5 3 colors.jpg | 500px]] | [[File:K 5 3 colors.jpg | 500px]] | ||
− | There is only <math>1</math> way to color all the edges in the same color. There is <math>\binom{4}{3} = 4</math> ways to color <math>3</math> of the edges in the same color. The probability of <math>3</math> or more edges the same color is <math>\frac{(1 + 4) \cdot 2}{2^4} = \frac{5}{8}</math>. | + | There is only <math>1</math> way to color all the edges in the same color. There is <math>\binom{4}{3} = 4</math> ways to color <math>3</math> of the edges in the same color. The probability of a graph with <math>3</math> or more edges the same color appearing is <math>\frac{(1 + 4) \cdot 2}{2^4} = \frac{5}{8}</math>. |
− | Case 2: When <math>2</math> edges are the same color, | + | Case 2: When <math>2</math> edges are the same color, graphs that doesn't contain a monochromatic <math>K_3</math> can exist. The following diagram shows steps to obtain graphs that doesn't contain a monochromatic <math>K_3</math>. |
[[File:K 5 2 colors.jpg | 500px]] | [[File:K 5 2 colors.jpg | 500px]] | ||
− | There are <math>\binom{4}{2} = 6</math> ways to color the edges with <math>2</math> edges the same color. There are <math>2^{10-4}</math> graphs with the <math>2</math> same colored edges | + | There are <math>\binom{4}{2} = 6</math> ways to color the edges with <math>2</math> edges the same color. There are <math>2^{10-4}</math> graphs with same arrangement of the <math>2</math> same colored edges in the above diagram, so there are <math>62</math> graphs that contain a monochromatic <math>K_3</math>. The probability of graphs with <math>2</math> edges the same color that contain a monochromatic <math>K_3</math> is <math>\frac{6}{2^4} \cdot \frac{62}{64}= \frac{3}{8} \cdot \frac{31}{32} = \frac{93}{256}</math>. |
<math>\frac{5}{8} + \frac{93}{256} = \boxed{(\textbf{D}) \frac{253}{256}}</math> | <math>\frac{5}{8} + \frac{93}{256} = \boxed{(\textbf{D}) \frac{253}{256}}</math> |
Revision as of 05:11, 1 January 2022
Problem
Each of the sides and the
diagonals of a regular pentagon are randomly and independently colored red or blue with equal probability. What is the probability that there will be a triangle whose vertices are among the vertices of the pentagon such that all of its sides have the same color?
Solution 1
Instead of finding the probability of a same-colored triangle appearing, let us find the probability that one does not appear. After drawing the regular pentagon out, note the topmost vertex; it has 4 sides/diagonals emanating outward from it. We do casework on the color distribution of these sides/diagonals.
: all 4 are colored one color. In that case, all of the remaining sides must be of the other color to not have a triangle where all three sides are of the same color. We can correspondingly fill out each color based on this constraint, but in this case you will always end up with a triangle where all three sides have the same color by inspection.
: 3 are one color and one is the other. Following the steps from the previous case, you can try filling out the colors, but will always arrive at a contradiction so this case does not work either.
: 2 are one color and 2 are of the other color. Using the same logic as previously, we can color the pentagon 2 different ways by inspection to satisfy the requirements. There are
ways to color the original sides/diagonals and 2 ways after that to color the remaining ones for a total of
ways to color the pentagon so that no such triangle has the same color for all of its sides.
These are all the cases, and there are a total of ways to color the pentagon. Therefore the answer is
~KingRavi
Solution 2 (Ramsey's Theorem)
This problem is related to a special case of Ramsey's Theorem, R(3, 3) = 6. Suppose we color every edge of a complete vertex graph
with
colors, there must exist a
vertex complete graph
with all it's edges in the same color. That is,
contains a monochromatic
.
Choose a vertex, there will be edges radiating from it.
Case 1: When or more edges are the same color, there must exist a monochromatic
. It is shown below. Suppose the color is red. There must be a same colored triangle as shown in the diagram below.
There is only way to color all the edges in the same color. There is
ways to color
of the edges in the same color. The probability of a graph with
or more edges the same color appearing is
.
Case 2: When edges are the same color, graphs that doesn't contain a monochromatic
can exist. The following diagram shows steps to obtain graphs that doesn't contain a monochromatic
.
There are ways to color the edges with
edges the same color. There are
graphs with same arrangement of the
same colored edges in the above diagram, so there are
graphs that contain a monochromatic
. The probability of graphs with
edges the same color that contain a monochromatic
is
.
See Also
2021 Fall AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 22 |
Followed by Problem 24 | |
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 | ||
All AMC 10 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.