https://artofproblemsolving.com/wiki/api.php?action=feedcontributions&user=Michaelchang1&feedformat=atomAoPS Wiki - User contributions [en]2021-01-27T19:31:50ZUser contributionsMediaWiki 1.31.1https://artofproblemsolving.com/wiki/index.php?title=2017_AMC_10A_Problems/Problem_19&diff=1419732017 AMC 10A Problems/Problem 192021-01-12T21:38:40Z<p>Michaelchang1: /* Solution 3: PIE */</p>
<hr />
<div>==Problem==<br />
Alice refuses to sit next to either Bob or Carla. Derek refuses to sit next to Eric. How many ways are there for the five of them to sit in a row of <math>5</math> chairs under these conditions?<br />
<br />
<math> \textbf{(A)}\ 12\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 28\qquad\textbf{(D)}\ 32\qquad\textbf{(E)}\ 40</math><br />
<br />
==Solution 1: Casework==<br />
<br />
For notation purposes, let Alice be A, Bob be B, Carla be C, Derek be D, and Eric be E.<br />
We can split this problem up into two cases:<br />
<br />
<math>\textbf{Case 1: }</math> A sits on an edge seat.<br />
<br />
Then, since B and C can't sit next to A, that must mean either D or E sits next to A. After we pick either D or E, then either B or C must sit next to D/E. Then, we can arrange the two remaining people in two ways. Since there are two different edge seats that A can sit in, there are a total of <math>2 \cdot 2 \cdot 2 \cdot 2 = 16</math>.<br />
<br />
<math>\textbf{Case 2: }</math> A does not sit in an edge seat.<br />
<br />
In this case, then only two people that can sit next to A are D and E, and there are two ways to permute them, and this also handles the restriction that D can't sit next to E. Then, there are two ways to arrange B and C, the remaining people. However, there are three initial seats that A can sit in, so there are <math>3 \cdot 2 \cdot 2 = 12</math> seatings in this case.<br />
<br />
Adding up all the cases, we have <math>16+12 = \boxed{\textbf{(C) } 28}</math>.<br />
<br />
==Solution 2==<br />
<br />
Label the seats (from left to right) <math>1</math> through <math>5</math>. The number of ways to seat Derek and Eric in the five seats with no restrictions is <math>5 \cdot 4=20</math>. The number of ways to seat Derek and Eric such that they sit next to each other is <math>8</math> (we can treat Derek and Eric as a "block". There are four ways to seat this "block", and two ways to permute Derek and Eric, for a total of <math>4\cdot 2=8</math>), so the number of ways such that Derek and Eric don't sit next to each other is <math>20-8=12</math>. Note that once Derek and Eric are seated, there are three cases. <br />
<br />
The first case is that they sit at each end. There are two ways to seat Derek and Eric. But this is impossible because then Alice, Bob, and Carla would have to sit in some order in the middle three seats which would lead to Alice sitting next to Bob or Carla, a contradiction. So this case gives us <math>0</math> ways.<br />
<br />
Another possible case is if Derek and Eric seat in seats <math>2</math> and <math>4</math> in some order. There are <math>2</math> possible ways to seat Derek and Eric like this. This leaves Alice, Bob, and Carla to sit in any order in the remaining three seats. Since no two of these three seats are consecutive, there are <math>3!=6</math> ways to do this. So the second case gives us <math>2 \cdot 6=12</math> total ways for the second case.<br />
<br />
The last case is if once Derek and Eric are seated, exactly one pair of consecutive seats are available. There are <math>12-2-2=8</math> ways to seat Derek and Eric like this. Once they are seated like this, Alice cannot sit in one of the two consecutive available seats without sitting next to Bob or Carla. So Alice has to sit in the other remaining chair. Then, there are two ways to seat Bob and Carla in the remaining two seats (which are consecutive). So this case gives us <math>8 \cdot 2=16</math> ways.<br />
<br />
So in total there are <math>12+16=28</math>. So our answer is <math>\boxed{\textbf{(C)}\ 28}</math>.<br />
<br><br />
Minor LaTeX edits by fasterthanlight<br />
<br />
Minor clarity edits by Carrot_Karen<br />
<br />
==Solution 3: PIE==<br />
<br />
We start with complementary counting. After all, it's much easier to count the cases where some of these restraints are true, then when they aren't.<br />
<br />
PIE:<br />
Let's count the total number of cases where one of these is true:<br />
<br />
When Alice is with Bob:<br />
<math>2\cdot4!=48</math><br />
<br />
When Alice is with Carla:<br />
<math>2\cdot4!=48</math><br />
<br />
When Carla is with Eric:<br />
<math>2\cdot4!=48</math><br />
<br />
Then, we count the cases where two of these are true.<br />
<br />
Alice is next to Bob Carla, and Alice is also next to Bob.<br />
There are two ways to rearrange Alice, Bob, and Carla so this is true:<br />
BAC and CAB.<br />
<math>2\cdot3!=12</math><br />
<br />
Alice is next to Carla, and Derek is also next to Eric.<br />
<math>2\cdot2\cdot3!=24</math><br />
<br />
Alice is next to Bob, and Derek is also next to Eric.<br />
<math>2\cdot2\cdot3!=24</math><br />
<br />
Finally, we count the cases where all three of these are true:<br />
<math>2\cdot2\cdot2=8</math><br />
<br />
We add the cases where one of these are true up:<br />
<math>48\cdot3=144</math><br />
<br />
Subtract the cases where two of these are true:<br />
<math>144-60=84</math><br />
<br />
And finally add back the cases where three of these are true:<br />
<math>84+8=92</math><br />
<br />
Thus, our answer is <math>5!-92=28</math>, or <math>\boxed{\textbf{(C)}}</math><br />
<br />
~michaelchang1<br />
<br />
==Video Solution==<br />
https://youtu.be/umr2Aj9ViOA<br />
<br />
==See Also==<br />
{{AMC10 box|year=2017|ab=A|num-b=18|num-a=20}}<br />
{{AMC12 box|year=2017|ab=A|num-b=13|num-a=15}}<br />
{{MAA Notice}}<br />
<br />
[[Category:Introductory Combinatorics Problems]]</div>Michaelchang1https://artofproblemsolving.com/wiki/index.php?title=2017_AMC_10A_Problems/Problem_19&diff=1419722017 AMC 10A Problems/Problem 192021-01-12T21:38:23Z<p>Michaelchang1: /* Solution 3: PIE */</p>
<hr />
<div>==Problem==<br />
Alice refuses to sit next to either Bob or Carla. Derek refuses to sit next to Eric. How many ways are there for the five of them to sit in a row of <math>5</math> chairs under these conditions?<br />
<br />
<math> \textbf{(A)}\ 12\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 28\qquad\textbf{(D)}\ 32\qquad\textbf{(E)}\ 40</math><br />
<br />
==Solution 1: Casework==<br />
<br />
For notation purposes, let Alice be A, Bob be B, Carla be C, Derek be D, and Eric be E.<br />
We can split this problem up into two cases:<br />
<br />
<math>\textbf{Case 1: }</math> A sits on an edge seat.<br />
<br />
Then, since B and C can't sit next to A, that must mean either D or E sits next to A. After we pick either D or E, then either B or C must sit next to D/E. Then, we can arrange the two remaining people in two ways. Since there are two different edge seats that A can sit in, there are a total of <math>2 \cdot 2 \cdot 2 \cdot 2 = 16</math>.<br />
<br />
<math>\textbf{Case 2: }</math> A does not sit in an edge seat.<br />
<br />
In this case, then only two people that can sit next to A are D and E, and there are two ways to permute them, and this also handles the restriction that D can't sit next to E. Then, there are two ways to arrange B and C, the remaining people. However, there are three initial seats that A can sit in, so there are <math>3 \cdot 2 \cdot 2 = 12</math> seatings in this case.<br />
<br />
Adding up all the cases, we have <math>16+12 = \boxed{\textbf{(C) } 28}</math>.<br />
<br />
==Solution 2==<br />
<br />
Label the seats (from left to right) <math>1</math> through <math>5</math>. The number of ways to seat Derek and Eric in the five seats with no restrictions is <math>5 \cdot 4=20</math>. The number of ways to seat Derek and Eric such that they sit next to each other is <math>8</math> (we can treat Derek and Eric as a "block". There are four ways to seat this "block", and two ways to permute Derek and Eric, for a total of <math>4\cdot 2=8</math>), so the number of ways such that Derek and Eric don't sit next to each other is <math>20-8=12</math>. Note that once Derek and Eric are seated, there are three cases. <br />
<br />
The first case is that they sit at each end. There are two ways to seat Derek and Eric. But this is impossible because then Alice, Bob, and Carla would have to sit in some order in the middle three seats which would lead to Alice sitting next to Bob or Carla, a contradiction. So this case gives us <math>0</math> ways.<br />
<br />
Another possible case is if Derek and Eric seat in seats <math>2</math> and <math>4</math> in some order. There are <math>2</math> possible ways to seat Derek and Eric like this. This leaves Alice, Bob, and Carla to sit in any order in the remaining three seats. Since no two of these three seats are consecutive, there are <math>3!=6</math> ways to do this. So the second case gives us <math>2 \cdot 6=12</math> total ways for the second case.<br />
<br />
The last case is if once Derek and Eric are seated, exactly one pair of consecutive seats are available. There are <math>12-2-2=8</math> ways to seat Derek and Eric like this. Once they are seated like this, Alice cannot sit in one of the two consecutive available seats without sitting next to Bob or Carla. So Alice has to sit in the other remaining chair. Then, there are two ways to seat Bob and Carla in the remaining two seats (which are consecutive). So this case gives us <math>8 \cdot 2=16</math> ways.<br />
<br />
So in total there are <math>12+16=28</math>. So our answer is <math>\boxed{\textbf{(C)}\ 28}</math>.<br />
<br><br />
Minor LaTeX edits by fasterthanlight<br />
<br />
Minor clarity edits by Carrot_Karen<br />
<br />
==Solution 3: PIE==<br />
<br />
We start with complementary counting. After all, it's much easier to count the cases where some of these restraints are true, then when they aren't.<br />
<br />
PIE:<br />
Let's count the total number of cases where one of these is true:<br />
<br />
When Alice is with Bob:<br />
<math>2\cdot4!=48</math><br />
<br />
When Alice is with Carla:<br />
<math>2\cdot4!=48</math><br />
<br />
When Carla is with Eric:<br />
<math>2\cdot4!=48</math><br />
<br />
Then, we count the cases where two of these are true.<br />
<br />
Alice is next to Bob Carla, and Alice is also next to Bob.<br />
There are two ways to rearrange Alice, Bob, and Carla so this is true:<br />
BAC and CAB.<br />
<math>2\cdot3!=12</math><br />
<br />
Alice is next to Carla, and Derek is also next to Eric.<br />
<math>2\cdot2\cdot3!=24</math><br />
<br />
Alice is next to Bob, and Derek is also next to Eric.<br />
<math>2\cdot2\cdot3!=24</math><br />
<br />
Finally, we count the cases where all three of these are true:<br />
<math>2\cdot2\cdot2=8</math><br />
<br />
We add the cases where one of these are true up:<br />
<math>48\cdot3=144</math><br />
<br />
Subtract the cases where two of these are true:<br />
<math>144-60=84</math><br />
<br />
And finally add back the cases where three of these are true:<br />
<math>84+8=92</math><br />
Thus, our answer is <math>5!-92=28</math>, or <math>\boxed{\textbf{(C)}}</math><br />
<br />
==Video Solution==<br />
https://youtu.be/umr2Aj9ViOA<br />
<br />
==See Also==<br />
{{AMC10 box|year=2017|ab=A|num-b=18|num-a=20}}<br />
{{AMC12 box|year=2017|ab=A|num-b=13|num-a=15}}<br />
{{MAA Notice}}<br />
<br />
[[Category:Introductory Combinatorics Problems]]</div>Michaelchang1https://artofproblemsolving.com/wiki/index.php?title=2017_AMC_10A_Problems/Problem_19&diff=1419712017 AMC 10A Problems/Problem 192021-01-12T21:37:31Z<p>Michaelchang1: /* Solution 3: PIE */</p>
<hr />
<div>==Problem==<br />
Alice refuses to sit next to either Bob or Carla. Derek refuses to sit next to Eric. How many ways are there for the five of them to sit in a row of <math>5</math> chairs under these conditions?<br />
<br />
<math> \textbf{(A)}\ 12\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 28\qquad\textbf{(D)}\ 32\qquad\textbf{(E)}\ 40</math><br />
<br />
==Solution 1: Casework==<br />
<br />
For notation purposes, let Alice be A, Bob be B, Carla be C, Derek be D, and Eric be E.<br />
We can split this problem up into two cases:<br />
<br />
<math>\textbf{Case 1: }</math> A sits on an edge seat.<br />
<br />
Then, since B and C can't sit next to A, that must mean either D or E sits next to A. After we pick either D or E, then either B or C must sit next to D/E. Then, we can arrange the two remaining people in two ways. Since there are two different edge seats that A can sit in, there are a total of <math>2 \cdot 2 \cdot 2 \cdot 2 = 16</math>.<br />
<br />
<math>\textbf{Case 2: }</math> A does not sit in an edge seat.<br />
<br />
In this case, then only two people that can sit next to A are D and E, and there are two ways to permute them, and this also handles the restriction that D can't sit next to E. Then, there are two ways to arrange B and C, the remaining people. However, there are three initial seats that A can sit in, so there are <math>3 \cdot 2 \cdot 2 = 12</math> seatings in this case.<br />
<br />
Adding up all the cases, we have <math>16+12 = \boxed{\textbf{(C) } 28}</math>.<br />
<br />
==Solution 2==<br />
<br />
Label the seats (from left to right) <math>1</math> through <math>5</math>. The number of ways to seat Derek and Eric in the five seats with no restrictions is <math>5 \cdot 4=20</math>. The number of ways to seat Derek and Eric such that they sit next to each other is <math>8</math> (we can treat Derek and Eric as a "block". There are four ways to seat this "block", and two ways to permute Derek and Eric, for a total of <math>4\cdot 2=8</math>), so the number of ways such that Derek and Eric don't sit next to each other is <math>20-8=12</math>. Note that once Derek and Eric are seated, there are three cases. <br />
<br />
The first case is that they sit at each end. There are two ways to seat Derek and Eric. But this is impossible because then Alice, Bob, and Carla would have to sit in some order in the middle three seats which would lead to Alice sitting next to Bob or Carla, a contradiction. So this case gives us <math>0</math> ways.<br />
<br />
Another possible case is if Derek and Eric seat in seats <math>2</math> and <math>4</math> in some order. There are <math>2</math> possible ways to seat Derek and Eric like this. This leaves Alice, Bob, and Carla to sit in any order in the remaining three seats. Since no two of these three seats are consecutive, there are <math>3!=6</math> ways to do this. So the second case gives us <math>2 \cdot 6=12</math> total ways for the second case.<br />
<br />
The last case is if once Derek and Eric are seated, exactly one pair of consecutive seats are available. There are <math>12-2-2=8</math> ways to seat Derek and Eric like this. Once they are seated like this, Alice cannot sit in one of the two consecutive available seats without sitting next to Bob or Carla. So Alice has to sit in the other remaining chair. Then, there are two ways to seat Bob and Carla in the remaining two seats (which are consecutive). So this case gives us <math>8 \cdot 2=16</math> ways.<br />
<br />
So in total there are <math>12+16=28</math>. So our answer is <math>\boxed{\textbf{(C)}\ 28}</math>.<br />
<br><br />
Minor LaTeX edits by fasterthanlight<br />
<br />
Minor clarity edits by Carrot_Karen<br />
<br />
==Solution 3: PIE==<br />
<br />
We start with complementary counting. After all, it's much easier to count the cases where some of these restraints are true, then when they aren't.<br />
<br />
PIE:<br />
Let's count the total number of cases where one of these is true:<br />
When Alice is with Bob:<br />
<math>2\cdot4!=48</math><br />
When Alice is with Carla:<br />
<math>2\cdot4!=48</math><br />
When Carla is with Eric:<br />
<math>2\cdot4!=48</math><br />
Then, we count the cases where two of these are true.<br />
Alice is next to Bob Carla, and Alice is also next to Bob.<br />
There are two ways to rearrange Alice, Bob, and Carla so this is true:<br />
BAC and CAB.<br />
<math>2\cdot3!=12</math><br />
Alice is next to Carla, and Derek is also next to Eric.<br />
<math>2\cdot2\cdot3!=24</math><br />
Alice is with Bob, and Derek is also with Eric.<br />
<math>2\cdot2\cdot3!=24</math><br />
Finally, we count the cases where all three of these are true:<br />
<math>2\cdot2\cdot2=8</math><br />
We add the cases where one of these are true up:<br />
<math>48\cdot3=144</math><br />
Subtract the cases where two of these are true:<br />
<math>144-60=84</math><br />
And finally add back the cases where three of these are true:<br />
<math>84+8=92</math><br />
Thus, our answer is <math>5!-92=28</math>, or <math>\boxed{\textbf{(C)}}</math><br />
<br />
==Video Solution==<br />
https://youtu.be/umr2Aj9ViOA<br />
<br />
==See Also==<br />
{{AMC10 box|year=2017|ab=A|num-b=18|num-a=20}}<br />
{{AMC12 box|year=2017|ab=A|num-b=13|num-a=15}}<br />
{{MAA Notice}}<br />
<br />
[[Category:Introductory Combinatorics Problems]]</div>Michaelchang1https://artofproblemsolving.com/wiki/index.php?title=2017_AMC_10A_Problems/Problem_19&diff=1419702017 AMC 10A Problems/Problem 192021-01-12T21:37:12Z<p>Michaelchang1: /* Solution 3: PIE */</p>
<hr />
<div>==Problem==<br />
Alice refuses to sit next to either Bob or Carla. Derek refuses to sit next to Eric. How many ways are there for the five of them to sit in a row of <math>5</math> chairs under these conditions?<br />
<br />
<math> \textbf{(A)}\ 12\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 28\qquad\textbf{(D)}\ 32\qquad\textbf{(E)}\ 40</math><br />
<br />
==Solution 1: Casework==<br />
<br />
For notation purposes, let Alice be A, Bob be B, Carla be C, Derek be D, and Eric be E.<br />
We can split this problem up into two cases:<br />
<br />
<math>\textbf{Case 1: }</math> A sits on an edge seat.<br />
<br />
Then, since B and C can't sit next to A, that must mean either D or E sits next to A. After we pick either D or E, then either B or C must sit next to D/E. Then, we can arrange the two remaining people in two ways. Since there are two different edge seats that A can sit in, there are a total of <math>2 \cdot 2 \cdot 2 \cdot 2 = 16</math>.<br />
<br />
<math>\textbf{Case 2: }</math> A does not sit in an edge seat.<br />
<br />
In this case, then only two people that can sit next to A are D and E, and there are two ways to permute them, and this also handles the restriction that D can't sit next to E. Then, there are two ways to arrange B and C, the remaining people. However, there are three initial seats that A can sit in, so there are <math>3 \cdot 2 \cdot 2 = 12</math> seatings in this case.<br />
<br />
Adding up all the cases, we have <math>16+12 = \boxed{\textbf{(C) } 28}</math>.<br />
<br />
==Solution 2==<br />
<br />
Label the seats (from left to right) <math>1</math> through <math>5</math>. The number of ways to seat Derek and Eric in the five seats with no restrictions is <math>5 \cdot 4=20</math>. The number of ways to seat Derek and Eric such that they sit next to each other is <math>8</math> (we can treat Derek and Eric as a "block". There are four ways to seat this "block", and two ways to permute Derek and Eric, for a total of <math>4\cdot 2=8</math>), so the number of ways such that Derek and Eric don't sit next to each other is <math>20-8=12</math>. Note that once Derek and Eric are seated, there are three cases. <br />
<br />
The first case is that they sit at each end. There are two ways to seat Derek and Eric. But this is impossible because then Alice, Bob, and Carla would have to sit in some order in the middle three seats which would lead to Alice sitting next to Bob or Carla, a contradiction. So this case gives us <math>0</math> ways.<br />
<br />
Another possible case is if Derek and Eric seat in seats <math>2</math> and <math>4</math> in some order. There are <math>2</math> possible ways to seat Derek and Eric like this. This leaves Alice, Bob, and Carla to sit in any order in the remaining three seats. Since no two of these three seats are consecutive, there are <math>3!=6</math> ways to do this. So the second case gives us <math>2 \cdot 6=12</math> total ways for the second case.<br />
<br />
The last case is if once Derek and Eric are seated, exactly one pair of consecutive seats are available. There are <math>12-2-2=8</math> ways to seat Derek and Eric like this. Once they are seated like this, Alice cannot sit in one of the two consecutive available seats without sitting next to Bob or Carla. So Alice has to sit in the other remaining chair. Then, there are two ways to seat Bob and Carla in the remaining two seats (which are consecutive). So this case gives us <math>8 \cdot 2=16</math> ways.<br />
<br />
So in total there are <math>12+16=28</math>. So our answer is <math>\boxed{\textbf{(C)}\ 28}</math>.<br />
<br><br />
Minor LaTeX edits by fasterthanlight<br />
<br />
Minor clarity edits by Carrot_Karen<br />
<br />
==Solution 3: PIE==<br />
<br />
We start with complementary counting. After all, it's much easier to count the cases where some of these restraints are true, then when they aren't.<br />
<br />
PIE:<br />
Let's count the total number of cases where one of these is true:<br />
When Alice is with Bob:<br />
<math>2\cdot4!=48</math><br />
When Alice is with Carla:<br />
<math>2\cdot4!=48</math><br />
When Carla is with Eric:<br />
<math>2\cdot4!=48</math><br />
Then, we count the cases where two of these are true.<br />
Alice is next to Bob Carla, and Alice is also next to Bob.<br />
There are two ways to rearrange Alice, Bob, and Carla so this is true:<br />
BAC and CAB.<br />
<math>2\cdot3!=12</math><br />
Alice is next to Carla, and Derek is also next to Eric.<br />
<math>2\cdot2\cdot3!=24</math><br />
Alice is with Bob, and Derek is also with Eric.<br />
<math>2\cdot2\cdot3!=24</math><br />
Finally, we count the cases where all three of these are true:<br />
<math>2\cdot2\cdot2=8</math><br />
We add the cases where one of these are true up:<br />
<math>48\cdot3=144</math><br />
Subtract the cases where two of these are true:<br />
<math>144-60=84</math><br />
And finally add back the cases where three of these are true:<br />
<math>84+8=92</math><br />
Thus, our answer is <math>5!-92=28</math>, or <math>\boxed{\textbf{(C) }</math><br />
<br />
==Video Solution==<br />
https://youtu.be/umr2Aj9ViOA<br />
<br />
==See Also==<br />
{{AMC10 box|year=2017|ab=A|num-b=18|num-a=20}}<br />
{{AMC12 box|year=2017|ab=A|num-b=13|num-a=15}}<br />
{{MAA Notice}}<br />
<br />
[[Category:Introductory Combinatorics Problems]]</div>Michaelchang1https://artofproblemsolving.com/wiki/index.php?title=2017_AMC_10A_Problems/Problem_19&diff=1419692017 AMC 10A Problems/Problem 192021-01-12T21:36:31Z<p>Michaelchang1: /* Solution 3: PIE */</p>
<hr />
<div>==Problem==<br />
Alice refuses to sit next to either Bob or Carla. Derek refuses to sit next to Eric. How many ways are there for the five of them to sit in a row of <math>5</math> chairs under these conditions?<br />
<br />
<math> \textbf{(A)}\ 12\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 28\qquad\textbf{(D)}\ 32\qquad\textbf{(E)}\ 40</math><br />
<br />
==Solution 1: Casework==<br />
<br />
For notation purposes, let Alice be A, Bob be B, Carla be C, Derek be D, and Eric be E.<br />
We can split this problem up into two cases:<br />
<br />
<math>\textbf{Case 1: }</math> A sits on an edge seat.<br />
<br />
Then, since B and C can't sit next to A, that must mean either D or E sits next to A. After we pick either D or E, then either B or C must sit next to D/E. Then, we can arrange the two remaining people in two ways. Since there are two different edge seats that A can sit in, there are a total of <math>2 \cdot 2 \cdot 2 \cdot 2 = 16</math>.<br />
<br />
<math>\textbf{Case 2: }</math> A does not sit in an edge seat.<br />
<br />
In this case, then only two people that can sit next to A are D and E, and there are two ways to permute them, and this also handles the restriction that D can't sit next to E. Then, there are two ways to arrange B and C, the remaining people. However, there are three initial seats that A can sit in, so there are <math>3 \cdot 2 \cdot 2 = 12</math> seatings in this case.<br />
<br />
Adding up all the cases, we have <math>16+12 = \boxed{\textbf{(C) } 28}</math>.<br />
<br />
==Solution 2==<br />
<br />
Label the seats (from left to right) <math>1</math> through <math>5</math>. The number of ways to seat Derek and Eric in the five seats with no restrictions is <math>5 \cdot 4=20</math>. The number of ways to seat Derek and Eric such that they sit next to each other is <math>8</math> (we can treat Derek and Eric as a "block". There are four ways to seat this "block", and two ways to permute Derek and Eric, for a total of <math>4\cdot 2=8</math>), so the number of ways such that Derek and Eric don't sit next to each other is <math>20-8=12</math>. Note that once Derek and Eric are seated, there are three cases. <br />
<br />
The first case is that they sit at each end. There are two ways to seat Derek and Eric. But this is impossible because then Alice, Bob, and Carla would have to sit in some order in the middle three seats which would lead to Alice sitting next to Bob or Carla, a contradiction. So this case gives us <math>0</math> ways.<br />
<br />
Another possible case is if Derek and Eric seat in seats <math>2</math> and <math>4</math> in some order. There are <math>2</math> possible ways to seat Derek and Eric like this. This leaves Alice, Bob, and Carla to sit in any order in the remaining three seats. Since no two of these three seats are consecutive, there are <math>3!=6</math> ways to do this. So the second case gives us <math>2 \cdot 6=12</math> total ways for the second case.<br />
<br />
The last case is if once Derek and Eric are seated, exactly one pair of consecutive seats are available. There are <math>12-2-2=8</math> ways to seat Derek and Eric like this. Once they are seated like this, Alice cannot sit in one of the two consecutive available seats without sitting next to Bob or Carla. So Alice has to sit in the other remaining chair. Then, there are two ways to seat Bob and Carla in the remaining two seats (which are consecutive). So this case gives us <math>8 \cdot 2=16</math> ways.<br />
<br />
So in total there are <math>12+16=28</math>. So our answer is <math>\boxed{\textbf{(C)}\ 28}</math>.<br />
<br><br />
Minor LaTeX edits by fasterthanlight<br />
<br />
Minor clarity edits by Carrot_Karen<br />
<br />
==Solution 3: PIE==<br />
<br />
We start with complementary counting. After all, it's much easier to count the cases where some of these restraints are true, then when they aren't.<br />
<br />
PIE:<br />
Let's count the total number of cases where one of these is true:<br />
When Alice is with Bob:<br />
<math>2\cdot4!=48</math><br />
When Alice is with Carla:<br />
<math>2\cdot4!=48</math><br />
When Carla is with Eric:<br />
<math>2\cdot4!=48</math><br />
Then, we count the cases where two of these are true.<br />
Alice is next to Bob Carla, and Alice is also next to Bob.<br />
There are two ways to rearrange Alice, Bob, and Carla so this is true:<br />
BAC and CAB.<br />
<math>2\cdot3!=12</math><br />
Alice is next to Carla, and Derek is also next to Eric.<br />
<math>2\cdot2\cdot3!=24</math><br />
Alice is with Bob, and Derek is also with Eric.<br />
<math>2\cdot2\cdot3!=24</math><br />
Finally, we count the cases where all three of these are true:<br />
<math>2\cdot2\cdot2=8</math><br />
We add the cases where one of these are true up:<br />
<math>48\cdot3=144</math><br />
Subtract the cases where two of these are true:<br />
<math>144-60=84</math><br />
And finally add back the cases where three of these are true:<br />
<math>84+8=92</math><br />
Thus, our answer is <math>5!-92=\boxed{28}</math>, or <math>\boxed{\textbf{(C) } 28}</math><br />
<br />
==Video Solution==<br />
https://youtu.be/umr2Aj9ViOA<br />
<br />
==See Also==<br />
{{AMC10 box|year=2017|ab=A|num-b=18|num-a=20}}<br />
{{AMC12 box|year=2017|ab=A|num-b=13|num-a=15}}<br />
{{MAA Notice}}<br />
<br />
[[Category:Introductory Combinatorics Problems]]</div>Michaelchang1https://artofproblemsolving.com/wiki/index.php?title=2017_AMC_10A_Problems/Problem_19&diff=1419682017 AMC 10A Problems/Problem 192021-01-12T21:36:15Z<p>Michaelchang1: </p>
<hr />
<div>==Problem==<br />
Alice refuses to sit next to either Bob or Carla. Derek refuses to sit next to Eric. How many ways are there for the five of them to sit in a row of <math>5</math> chairs under these conditions?<br />
<br />
<math> \textbf{(A)}\ 12\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 28\qquad\textbf{(D)}\ 32\qquad\textbf{(E)}\ 40</math><br />
<br />
==Solution 1: Casework==<br />
<br />
For notation purposes, let Alice be A, Bob be B, Carla be C, Derek be D, and Eric be E.<br />
We can split this problem up into two cases:<br />
<br />
<math>\textbf{Case 1: }</math> A sits on an edge seat.<br />
<br />
Then, since B and C can't sit next to A, that must mean either D or E sits next to A. After we pick either D or E, then either B or C must sit next to D/E. Then, we can arrange the two remaining people in two ways. Since there are two different edge seats that A can sit in, there are a total of <math>2 \cdot 2 \cdot 2 \cdot 2 = 16</math>.<br />
<br />
<math>\textbf{Case 2: }</math> A does not sit in an edge seat.<br />
<br />
In this case, then only two people that can sit next to A are D and E, and there are two ways to permute them, and this also handles the restriction that D can't sit next to E. Then, there are two ways to arrange B and C, the remaining people. However, there are three initial seats that A can sit in, so there are <math>3 \cdot 2 \cdot 2 = 12</math> seatings in this case.<br />
<br />
Adding up all the cases, we have <math>16+12 = \boxed{\textbf{(C) } 28}</math>.<br />
<br />
==Solution 2==<br />
<br />
Label the seats (from left to right) <math>1</math> through <math>5</math>. The number of ways to seat Derek and Eric in the five seats with no restrictions is <math>5 \cdot 4=20</math>. The number of ways to seat Derek and Eric such that they sit next to each other is <math>8</math> (we can treat Derek and Eric as a "block". There are four ways to seat this "block", and two ways to permute Derek and Eric, for a total of <math>4\cdot 2=8</math>), so the number of ways such that Derek and Eric don't sit next to each other is <math>20-8=12</math>. Note that once Derek and Eric are seated, there are three cases. <br />
<br />
The first case is that they sit at each end. There are two ways to seat Derek and Eric. But this is impossible because then Alice, Bob, and Carla would have to sit in some order in the middle three seats which would lead to Alice sitting next to Bob or Carla, a contradiction. So this case gives us <math>0</math> ways.<br />
<br />
Another possible case is if Derek and Eric seat in seats <math>2</math> and <math>4</math> in some order. There are <math>2</math> possible ways to seat Derek and Eric like this. This leaves Alice, Bob, and Carla to sit in any order in the remaining three seats. Since no two of these three seats are consecutive, there are <math>3!=6</math> ways to do this. So the second case gives us <math>2 \cdot 6=12</math> total ways for the second case.<br />
<br />
The last case is if once Derek and Eric are seated, exactly one pair of consecutive seats are available. There are <math>12-2-2=8</math> ways to seat Derek and Eric like this. Once they are seated like this, Alice cannot sit in one of the two consecutive available seats without sitting next to Bob or Carla. So Alice has to sit in the other remaining chair. Then, there are two ways to seat Bob and Carla in the remaining two seats (which are consecutive). So this case gives us <math>8 \cdot 2=16</math> ways.<br />
<br />
So in total there are <math>12+16=28</math>. So our answer is <math>\boxed{\textbf{(C)}\ 28}</math>.<br />
<br><br />
Minor LaTeX edits by fasterthanlight<br />
<br />
Minor clarity edits by Carrot_Karen<br />
<br />
==Solution 3: PIE==<br />
<br />
We start with complementary counting. After all, it's much easier to count the cases where some of these restraints are true, then when they aren't.<br />
<br />
PIE:<br />
Let's count the total number of cases where one of these is true:<br />
When Alice is with Bob:<br />
<math>2\cdot4!=48</math><br />
When Alice is with Carla:<br />
<math>2\cdot4!=48</math><br />
When Carla is with Eric:<br />
<math>2\cdot4!=48</math><br />
Then, we count the cases where two of these are true.<br />
Alice is next to Bob Carla, and Alice is also next to Bob.<br />
There are two ways to rearrange Alice, Bob, and Carla so this is true:<br />
BAC and CAB.<br />
<math>2\cdot3!=12</math><br />
Alice is next to Carla, and Derek is also next to Eric.<br />
<math>2\cdot2\cdot3!=24</math><br />
Alice is with Bob, and Derek is also with Eric.<br />
<math>2\cdot2\cdot3!=24</math><br />
Finally, we count the cases where all three of these are true:<br />
<math>2\cdot2\cdot2=8</math><br />
We add the cases where one of these are true up:<br />
<math>48\cdot3=144</math><br />
Subtract the cases where two of these are true:<br />
<math>144-60=84</math><br />
And finally add back the cases where three of these are true:<br />
<math>84+8=92</math><br />
Thus, our answer is <math>5!-92=\boxed{28}</math>, or <math>\boxed{\textbf{(C) } 28}</math><br />
$<br />
==Video Solution==<br />
https://youtu.be/umr2Aj9ViOA<br />
<br />
==See Also==<br />
{{AMC10 box|year=2017|ab=A|num-b=18|num-a=20}}<br />
{{AMC12 box|year=2017|ab=A|num-b=13|num-a=15}}<br />
{{MAA Notice}}<br />
<br />
[[Category:Introductory Combinatorics Problems]]</div>Michaelchang1https://artofproblemsolving.com/wiki/index.php?title=User:Michaelchang1&diff=140644User:Michaelchang12020-12-26T14:05:28Z<p>Michaelchang1: Created page with "Is a human"</p>
<hr />
<div>Is a human</div>Michaelchang1https://artofproblemsolving.com/wiki/index.php?title=User:Piphi&diff=139474User:Piphi2020-12-12T03:00:05Z<p>Michaelchang1: /* User Count */</p>
<hr />
<div>{{User:Piphi/Template:Header}}<br />
<br><br />
__NOTOC__<div style="border:2px solid black; -webkit-border-radius: 10px; background:#F0F2F3"><br />
==<font color="black" style="font-family: ITC Avant Garde Gothic Std, Verdana"><div style="margin-left:10px">User Count</div></font>==<br />
<div style="margin-left: 10px; margin-bottom:10px"><font color="black">If this is your first time visiting this page, edit it by incrementing the user count below by one.</font></div><br />
<center><font size="100px">405</font></center><br />
</div><br />
<div style="border:2px solid black; background:#B1B2B3;-webkit-border-radius: 10px; align:center"><br />
<br />
==<font color="black" style="font-family: ITC Avant Garde Gothic Std, Verdana"><div style="margin-left:10px">About Me</div></font>==<br />
<div style="margin-left: 10px; margin-bottom:10px"><font color="black">Piphi is the creator of the [[User:Piphi/Games|AoPS Wiki Games by Piphi]], the future of games on AoPS.<br><br />
<br />
Piphi started the signature trend at around May 2020.<br><br />
<br />
Piphi has been very close to winning multiple [[Greed Control]] games, piphi placed 5th in game #18 and 2nd in game #19. Thanks to piphi, Greed Control games have started to be kept track of. Piphi made a spreadsheet that has all of Greed Control history [https://artofproblemsolving.com/community/c19451h2126208p15569802 here].<br><br />
<br />
Piphi also found out who won [[Reaper]] games #1 and #2 as seen [https://artofproblemsolving.com/community/c19451h1826745p15526330 here].<br><br />
<br />
Piphi created the [[AoPS Administrators]] page, added most of the AoPS Admins to it, and created the scrollable table.<br><br />
<br />
Piphi has also added a lot of the info that is in the [[Reaper Archives]].<br><br />
<br />
Piphi has a side-project that is making the Wiki's [[Main Page]] look better, you can check that out [[User:Piphi/AoPS Wiki|here]].<br><br />
<br />
Piphi published Greed Control Game 19 statistics [https://artofproblemsolving.com/community/c19451h2126212 here].<br />
<br />
Piphi has a post that was made an announcement in a official AoPS Forum [https://artofproblemsolving.com/community/c68h2175116 here].<br />
<br />
Piphi is a proud member of [https://artofproblemsolving.com/community/c562043 The Interuniversal GMAAS Society].<br />
<br />
Piphi has won 2 gold trophies at the [https://artofproblemsolving.com/community/c1124279 Asymptote Competition] and is now part of the staff.<br />
</font></div><br />
</div><br />
<div style="border:2px solid black; background:#727373;-webkit-border-radius: 10px; align:center"><br />
<br />
==<font color="#f0f2f3" style="font-family: ITC Avant Garde Gothic Std, Verdana"><div style="margin-left:10px">Goals</div></font>==<br />
<div style="margin-left: 10px; margin-right: 10px; margin-bottom:10px"><font color="#f0f2f3"><br />
You can check out more goals/statistics [[User:Piphi/Statistics|here]].<br />
<br />
A User Count of 500<br />
{{User:Piphi/Template:Progress_Bar|80.2|width=100%}}<br />
<br />
200 subpages of [[User:Piphi]]<br />
{{User:Piphi/Template:Progress_Bar|64.5|width=100%}}<br />
<br />
200 signups for [[User:Piphi/Games|AoPS Wiki Games by Piphi]]<br />
{{User:Piphi/Template:Progress_Bar|47.5|width=100%}}<br />
<br />
Make 10,000 edits<br />
{{User:Piphi/Template:Progress_Bar|20.36|width=100%}}</font></div><br />
</div></div>Michaelchang1https://artofproblemsolving.com/wiki/index.php?title=Wooga_Looga_Theorem&diff=137902Wooga Looga Theorem2020-11-20T01:27:23Z<p>Michaelchang1: /* Testimonials */</p>
<hr />
<div>=Definition=<br />
If there is <math>\triangle ABC</math> and points <math>D,E,F</math> on the sides <math>BC,CA,AB</math> respectively such that <math>\frac{DB}{DC}=\frac{EC}{EA}=\frac{FA}{FB}=r</math>, then the ratio <math>\frac{[DEF]}{[ABC]}=\frac{r^2-r+1}{(r+1)^2}</math>.<br />
<br />
<br />
Created by Foogle and Hoogle of [https://www.youtube.com/channel/UC50E9TuLIMWbOPUX45xZPaQ The Ooga Booga Tribe of The Caveman Society]<br />
<br />
=Proofs=<br />
==Proof 1==<br />
Proof by Gogobao:<br />
<br />
We have: <math>\frac{DB}{BC} = \frac{r}{r+1}, \frac{DC}{BC} = \frac{1}{r+1}, \frac{EC}{AC} = \frac{r}{r+1}, \frac{EA}{AC} = \frac{1}{r+1}, \frac{FA}{BA} = \frac{r}{r+1}, \frac{FB}{BA} = \frac{1}{r+1} </math><br />
<br />
We have: <math>[DEF] = [ABC] - [DCE] - [FAE] - [FBD]</math><br />
<br />
<math>[DCE] = [ABC] \cdot \frac{DC}{CB} \cdot \frac{CE}{CA} = [ABC] \cdot \frac{r}{(r+1)^2}</math><br />
<br />
<math>[EAF] = [ABC] \cdot \frac{EA}{CA} \cdot \frac{FA}{BA} = [ABC] \cdot \frac{r}{(r+1)^2}</math><br />
<br />
<math>[FBD] = [ABC] \cdot \frac{FB}{AB} \cdot \frac{BD}{CB} = [ABC] \cdot \frac{r}{(r+1)^2}</math><br />
<br />
Therefore <math>[DEF] = [ABC] (1-\frac{3r}{(r+1)^2})</math><br />
<br />
So we have <math>\frac{[DEF]}{[ABC]} = \frac{r^2-r+1}{(r+1)^2}</math><br />
<br />
==Proof 2==<br />
Proof by franzliszt<br />
<br />
Apply Barycentrics w.r.t. <math>\triangle ABC</math>. Then <math>A=(1,0,0),B=(0,1,0),C=(0,0,1)</math>. We can also find that <math>D=\left(0,\tfrac {1}{r+1},\tfrac {r}{r+1}\right),E=\left(\tfrac {r}{r+1},0,\tfrac {1}{r+1}\right),F=\left(\tfrac {1}{r+1},\tfrac {r}{r+1},0\right)</math>. In the barycentric coordinate system, the area formula is <math>[XYZ]=\begin{vmatrix} x_{1} &y_{1} &z_{1} \\ x_{2} &y_{2} &z_{2} \\ x_{3}& y_{3} & z_{3} \end{vmatrix}\cdot [ABC]</math> where <math>\triangle XYZ</math> is a random triangle and <math>\triangle ABC</math> is the reference triangle. Using this, we find that <cmath>\frac{[DEF]}{[ABC]}= \begin{vmatrix} 0&\tfrac {1}{r+1}&\tfrac {r}{r+1} \\ \tfrac {r}{r+1}&0&\tfrac {1}{r+1}\\ \tfrac {1}{r+1}&\tfrac {r}{r+1}&0 \end{vmatrix}=\frac{r^2-r+1}{(r+1)^2}.</cmath><br />
<br />
==Proof 3==<br />
Proof by RedFireTruck:<br />
<br />
WLOG we let <math>A=(0, 0)</math>, <math>B=(1, 0)</math>, <math>C=(x, y)</math> for <math>x</math>, <math>y\in\mathbb{R}</math>. We then use Shoelace Forumla to get <math>[ABC]=\frac12|y|</math>. We then figure out that <math>D=\left(\frac{rx+1}{r+1}, \frac{ry}{r+1}\right)</math>, <math>E=\left(\frac{x}{r+1}, \frac{y}{r+1}\right)</math>, and <math>F=\left(\frac{r}{r+1}, 0\right)</math> so we know that by Shoelace Formula <math>\frac{[DEF]}{[ABC]}=\frac{\frac12\left|\frac{r^2y-ry+y}{(r+1)^2}\right|}{\frac12|y|}=\left|\frac{r^2-r+1}{(r+1)^2}\right|</math>. We know that <math>\frac{r^2-r+1}{(r+1)^2}\ge0</math> for all <math>r\in\mathbb{R}</math> so <math>\left|\frac{r^2-r+1}{(r+1)^2}\right|=\frac{r^2-r+1}{(r+1)^2}</math>.<br />
<br />
==Proof 4==<br />
Proof by jasperE3:<br />
<br />
The Wooga Looga theorem is a direct application of Routh's Theorem when a=b=c.<br />
<br />
=Application 1=<br />
==Problem==<br />
The Wooga Looga Theorem states that the solution to this problem by franzliszt:<br />
<br />
In <math>\triangle ABC</math> points <math>X,Y,Z</math> are on sides <math>BC,CA,AB</math> such that <math>\frac{XB}{XC}=\frac{YC}{YA}=\frac{ZA}{ZB}=\frac 71</math>. Find the ratio of <math>[XYZ]</math> to <math>[ABC]</math>.<br />
<br />
==Solution 1==<br />
is this solution by RedFireTruck:<br />
<br />
WLOG let <math>A=(0, 0)</math>, <math>B=(1, 0)</math>, <math>C=(x, y)</math>. Then <math>[ABC]=\frac12|y|</math> by Shoelace Theorem and <math>X=\left(\frac{7x+1}{8}, \frac{7y}{8}\right)</math>, <math>Y=\left(\frac{x}{8}, \frac{y}{8}\right)</math>, <math>Z=\left(\frac78, 0\right)</math>. Then <math>[XYZ]=\frac12\left|\frac{43y}{64}\right|</math> by Shoelace Theorem. Therefore the answer is <math>\boxed{\frac{43}{64}}</math>.<br />
==Solution 2==<br />
or this solution by franzliszt:<br />
<br />
We apply Barycentric Coordinates w.r.t. <math>\triangle ABC</math>. Let <math>A=(1,0,0),B=(0,1,0),C=(0,0,1)</math>. Then we find that <math>X=\left(0,\tfrac 18,\tfrac 78\right),Y=\left(\tfrac 78,0,\tfrac 18\right),Z=\left(\tfrac18,\tfrac78,0\right)</math>. In the barycentric coordinate system, the area formula is <math>[XYZ]=\begin{vmatrix}<br />
x_{1} &y_{1} &z_{1} \\<br />
x_{2} &y_{2} &z_{2} \\ <br />
x_{3}& y_{3} & z_{3}<br />
\end{vmatrix}\cdot [ABC]</math> where <math>\triangle XYZ</math> is a random triangle and <math>\triangle ABC</math> is the reference triangle. Using this, we find that <cmath>\frac{[XYZ]}{[ABC]}=\begin{vmatrix}<br />
0&\tfrac 18&\tfrac 78\\<br />
\tfrac 78&0&\tfrac 18\\<br />
\tfrac18&\tfrac78&0<br />
\end{vmatrix}=\frac{43}{64}.</cmath> <math>\blacksquare</math><br />
==Solution 3==<br />
or this solution by aaja3427:<br />
<br />
According the the Wooga Looga Theorem, It is <math>\frac{49-7+1}{8^2}</math>. This is <math>\boxed{\frac{43}{64}}</math><br />
<br />
==Solution 5==<br />
or this solution by eduD_looC:<br />
<br />
This is a perfect application of the Adihaya Jayasharmaramankumarguptareddybavarajugopal's Lemma, which results in the answer being <math>\boxed{\frac{43}{64}}</math>. A very beautiful application, which leaves graders and readers speechless.<br />
<br />
==Solution 6==<br />
or this solution by CoolJupiter:<br />
<br />
Wow. All of your solutions are slow, compared to my sol:<br />
<br />
By math, we have <math>\boxed{\frac{43}{64}}</math>.<br />
<br />
~CoolJupiter<br />
^<br />
|<br />
EVERYONE USE THIS SOLUTION IT'S BRILLIANT <br />
~bsu1<br />
Yes, very BRILLIANT!<br />
~ TheAoPSLebron<br />
<br />
==The Best Solution==<br />
<br />
By the 1+1=2 principle, we get <math>\boxed{\frac{43}{64}}</math>. Definitely the best method. When asked, please say that OlympusHero taught you this method. Cuz he did.<br />
<br />
=Application 2=<br />
==Problem==<br />
The Wooga Looga Theorem states that the solution to this problem by Matholic:<br />
<br />
The figure below shows a triangle ABC whose area is <math>72 \text{cm}^2</math>. If <math>\dfrac{AD}{DB}=\dfrac{BE}{EC}=\dfrac{CF}{FA}=\dfrac{1}{5}</math>, find <math>[DEF].</math><br />
<br />
~LaTeX-ifyed by RP3.1415<br />
<br />
==Solution 1==<br />
is this solution by franzliszt:<br />
<br />
We apply Barycentric Coordinates w.r.t. <math>\triangle ABC</math>. Let <math>A=(1,0,0),B=(0,1,0),C=(0,0,1)</math>. Then we find that <math>D=(\tfrac 56,\tfrac 16,0),E=(0,\tfrac 56,\tfrac 16),F=(\tfrac16,0,\tfrac56)</math>. In the barycentric coordinate system, the area formula is <math>[XYZ]=\begin{vmatrix}<br />
x_{1} &y_{1} &z_{1} \\ <br />
x_{2} &y_{2} &z_{2} \\ <br />
x_{3}& y_{3} & z_{3}<br />
\end{vmatrix}\cdot [ABC]</math> where <math>\triangle XYZ</math> is a random triangle and <math>\triangle ABC</math> is the reference triangle. Using this, we find that<cmath>\frac{[DEF]}{[72]}=\begin{vmatrix}<br />
\tfrac 56&\tfrac 16&0\\<br />
0&\tfrac 56&\tfrac 16\\<br />
\tfrac16&0&\tfrac56<br />
\end{vmatrix}=\frac{7}{12}</cmath> so <math>[DEF]=42</math>. <math>\blacksquare</math><br />
==Solution 2==<br />
or this solution by RedFireTruck:<br />
<br />
By the Wooga Looga Theorem, <math>\frac{[DEF]}{[ABC]}=\frac{5^2-5+1}{(5+1)^2}=\frac{21}{36}=\frac{7}{12}</math>. We are given that <math>[ABC]=72</math> so <math>[DEF]=\frac{7}{12}\cdot72=\boxed{42}</math><br />
<br />
=Application 3=<br />
==Problem==<br />
The Wooga Looga Theorem states that the solution to this problem by RedFireTruck:<br />
<br />
Find the ratio <math>\frac{[GHI]}{[ABC]}</math> if <math>\frac{AD}{DB}=\frac{BE}{EC}=\frac{CF}{FA}=\frac12</math> and <math>\frac{DG}{GE}=\frac{EH}{HF}=\frac{FI}{ID}=1</math> in the diagram below.<asy><br />
draw((0, 0)--(6, 0)--(4, 3)--cycle);<br />
draw((2, 0)--(16/3, 1)--(8/3, 2)--cycle);<br />
draw((11/3, 1/2)--(4, 3/2)--(7/3, 1)--cycle);<br />
label("$A$", (0, 0), SW);<br />
label("$B$", (6, 0), SE);<br />
label("$C$", (4, 3), N);<br />
label("$D$", (2, 0), S);<br />
label("$E$", (16/3, 1), NE);<br />
label("$F$", (8/3, 2), NW);<br />
label("$G$", (11/3, 1/2), SE);<br />
label("$H$", (4, 3/2), NE);<br />
label("$I$", (7/3, 1), W);<br />
</asy><br />
==Solution 1==<br />
is this solution by franzliszt:<br />
<br />
By the Wooga Looga Theorem, <math>\frac{[DEF]}{[ABC]}=\frac{2^2-2+1}{(1+2)^2}=\frac 13</math>. Notice that <math>\triangle GHI</math> is the medial triangle of '''Wooga Looga Triangle ''' of <math>\triangle ABC</math>. So <math>\frac{[GHI]}{[DEF]}=\frac 14</math> and <math>\frac{[GHI]}{[ABD]}=\frac{[DEF]}{[ABC]}\cdot\frac{[GHI]}{[DEF]}=\frac 13 \cdot \frac 14 = \frac {1}{12}</math> by Chain Rule ideas.<br />
<br />
==Solution 2==<br />
or this solution by franzliszt:<br />
<br />
Apply Barycentrics w.r.t. <math>\triangle ABC</math> so that <math>A=(1,0,0),B=(0,1,0),C=(0,0,1)</math>. Then <math>D=(\tfrac 23,\tfrac 13,0),E=(0,\tfrac 23,\tfrac 13),F=(\tfrac 13,0,\tfrac 23)</math>. And <math>G=(\tfrac 13,\tfrac 12,\tfrac 16),H=(\tfrac 16,\tfrac 13,\tfrac 12),I=(\tfrac 12,\tfrac 16,\tfrac 13)</math>.<br />
<br />
In the barycentric coordinate system, the area formula is <math>[XYZ]=\begin{vmatrix} x_{1} &y_{1} &z_{1} \\ x_{2} &y_{2} &z_{2} \\ x_{3}& y_{3} & z_{3} \end{vmatrix}\cdot [ABC]</math> where <math>\triangle XYZ</math> is a random triangle and <math>\triangle ABC</math> is the reference triangle. Using this, we find that<cmath>\frac{[GHI]}{[ABC]}=\begin{vmatrix} \tfrac 13&\tfrac 12&\tfrac 16\\ \tfrac 16&\tfrac 13&\tfrac 12\\ \tfrac 12&\tfrac 16&\tfrac 13 \end{vmatrix}=\frac{1}{12}.</cmath><br />
<br />
=Application 4=<br />
==Problem==<br />
<br />
Let <math>ABC</math> be a triangle and <math>D,E,F</math> be points on sides <math>BC,AC,</math> and <math>AB</math> respectively. We have that <math>\frac{BD}{DC} = 3</math> and similar for the other sides. If the area of triangle <math>ABC</math> is <math>16</math>, then what is the area of triangle <math>DEF</math>? (By ilovepizza2020)<br />
<br />
==Solution 1==<br />
<br />
By Franzliszt<br />
<br />
By Wooga Looga, <math>\frac{[DEF]}{16} = \frac{3^2-3+1}{(3+1)^2}=\frac{7}{16}</math> so the answer is <math>7</math>.<br />
<br />
==Solution 2==<br />
<br />
By franzliszt<br />
<br />
Apply Barycentrics w.r.t. <math>\triangle ABC</math>. Then <math>A=(1,0,0),B=(0,1,0),C=(0,0,1)</math>. We can also find that <math>D=(0,\tfrac 14,\tfrac 34),E=(\tfrac 34,0,\tfrac 14),F=(\tfrac 14,\tfrac 34,0)</math>. In the barycentric coordinate system, the area formula is <math>[XYZ]=\begin{vmatrix} x_{1} &y_{1} &z_{1} \\ x_{2} &y_{2} &z_{2} \\ x_{3}& y_{3} & z_{3} \end{vmatrix}\cdot [ABC]</math> where <math>\triangle XYZ</math> is a random triangle and <math>\triangle ABC</math> is the reference triangle. Using this, we find that<cmath>\frac{[DEF]}{[ABC]}=\begin{vmatrix} 0&\tfrac 14&\tfrac 34\\ \tfrac 34&0&\tfrac 14\\ \tfrac 14&\tfrac 34&0 \end{vmatrix}=\frac{7}{16}.</cmath>So the answer is <math>\boxed{7}</math>.<br />
<br />
=Testimonials=<br />
Thanks for rediscovering our theorem RedFireTruck - Foogle and Hoogle of [https://www.youtube.com/channel/UC50E9TuLIMWbOPUX45xZPaQ The Ooga Booga Tribe of The Caveman Society]<br />
<br />
Franzlist is wooga looga howsopro - volkie boy<br />
<br />
The Wooga Looga Theorem is EPIC POGGERS WHOLESOME 100 KEANU CHUNGUS AMAZING SKILL THEOREM!!!!!1!!!111111 -centslordm<br />
<br />
The Wooga Looga Theorem can be used to prove many problems and should be a part of any geometry textbook.<br />
~ilp2020<br />
<br />
The Wooga Looga Theorem is amazing and can be applied to so many problems and should be taught in every school. - RedFireTruck<br />
<br />
The Wooga Looga Theorem is the best. -aaja3427<br />
<br />
The Wooga Looga Theorem is needed for everything and it is great-hi..<br />
<br />
The Wooga Looga Theorem was made by the author of the 5th Testimonial, RedFireTruck, which means they are the ooga booga tribe... proof: go to https://www.youtube.com/channel/UC50E9TuLIMWbOPUX45xZPaQ and click "about". now copy and paste the aops URL. you got RedFireTruck! Great Job! now go check out his thread for post milestones, https://artofproblemsolving.com/community/c3h2319596, and give him a friend request! -FPT<br />
<br />
This theorem has helped me with school and I am no longer failing my math class. -mchang<br />
<br />
"I can't believe AoPS books don't have this amazing theorem. If you need help with math, you can depend on caveman." ~CoolJupiter<br />
<br />
Before the Wooga Looga Theorem, I had NO IDEA how to solve any hard geo. But, now that I've learned it, I can solve hard geo in 7 seconds ~ ilp2020 (2nd testimonial by me)<br />
<br />
Too powerful... ~franzliszt<br />
<br />
The Wooga Looga Theorem is so pro ~ ac142931<br />
<br />
It is so epic and awesome that it will blow the minds of people if they saw this ~ ac142931(2nd testimonial by me)<br />
<br />
This theorem changed my life... ~ samrocksnature<br />
<br />
Math competitions need to ban the use of the Wooga Looga Theorem, it's just too good. ~ jasperE3<br />
<br />
It actually can be. I never thought I'd say this, but the Wooga Looga theorem is a legit theorem. ~ jasperE3<br />
<br />
This is franzliszt and I endorse this theorem. ~franzliszt<br />
<br />
This theorem is too OP. ~bestzack66<br />
<br />
This is amazing! However much it looks like a joke, it is a legitimate - and powerful - theorem. -Supernova283<br />
<br />
Wooga Looga Theorem is extremely useful. Someone needs to make a handout on this so everyone can obtain the power of Wooga Looga ~RP3.1415<br />
<br />
The Wooga Looga cavemen were way ahead of their time. Good job (dead) guys! -HIA2020<br />
<br />
It's like the Ooga Booga Theorem (also OP), but better!!! - BobDBuilder321<br />
<br />
The Wooga Looga Theorem is a special case of [url=https://en.wikipedia.org/wiki/Routh%27s_theorem]Routh's Theorem.[/url] So this wiki article is DEFINITELY needed. -peace<br />
<br />
I actually thought this was a joke theorem until I read this page - HumanCalculator9<br />
<br />
I endorse the Wooga Looga theorem for its utter usefulness and seriousness. -HamstPan38825<br />
<br />
This is <i>almost</i> as OP as the Adihaya Jayasharmaramankumarguptareddybavarajugopal Lemma. Needs to be nerfed. -CoolCarsonTheRun<br />
<br />
I ReAlLy don't get it - Senguamar<br />
<br />
The Wooga Looga Theorem is the base of all geometry. It is so OP that even I don't understand how to use it.</div>Michaelchang1https://artofproblemsolving.com/wiki/index.php?title=User:OlympusHero&diff=135831User:OlympusHero2020-10-26T03:02:16Z<p>Michaelchang1: /* User Count */</p>
<hr />
<div>OlympusHero's Page:<br />
<br><br />
__NOTOC__<div style="border:2px solid black; -webkit-border-radius: 10px; background:#dddddd"><br />
==<font color="black" style="font-family: ITC Avant Garde Gothic Std, Verdana"><div style="margin-left:10px">User Count</div></font>==<br />
<div style="margin-left: 10px; margin-bottom:10px"><font color="black">If this is your first time visiting this page, edit it by incrementing the user count below by one.</font></div><br />
<center><font size="107px"> 71th user MICHAELCHANG1<br />
</font></center><br />
</div><br />
<div style="border:2px solid black; background:#cccccc;-webkit-border-radius: 10px; align:center"><br />
<br />
==<font color="black" style="font-family: ITC Avant Garde Gothic Std, Verdana"><div style="margin-left:10px">About Me</div></font>==<br />
<div style="margin-left: 10px; margin-bottom:10px"><font color="black">OlympusHero is currently borderline AIME.<br><br />
<br />
OlympusHero is 10 years old.<br><br />
<br />
OlympusHero scored 47/46 (got an extra point for finishing the test under 10 minutes) when mocking the 2019 MATHCOUNTS State test, and got silver on the 2020 online MATHCOUNTS State.<br><br />
<br />
OlympusHero is a pro at math and chess<br />
<br />
OlympusHero for brown MOP 2021<br />
<br />
OlympusHero was #1 at the 2017 Chess World Cadets U8 (He was 7 years old)<br />
<br />
OlympusHero is pro at joking believe it.<br />
<br />
OlympusHero is much better than Rusczyk at math yes or no, no one knows.<br />
</font></div><br />
</div><br />
<div style="border:2px solid black; background:#bbbbbb;-webkit-border-radius: 10px; align:center"><br />
<br />
==<font color="black" style="font-family: ITC Avant Garde Gothic Std, Verdana"><div style="margin-left:10px">Goals</div></font>==<br />
<div style="margin-left: 10px; margin-right: 10px; margin-bottom:10px">A User Count of 300<br />
<br />
Make AIME 2021 (Currently borderline)<br />
<br />
Get 5 or more on AIME I 2021 (Mocked a 3 on the 2020 AIME I a few months ago)<br />
<br />
Get to 40 or more on the MATHCOUNTS Trainer Nationals Level (25/40)<br />
<br />
Get a perfect score and First Place in IMO 2021.<br />
</div><br />
</div></div>Michaelchang1