Amy Gets Dogged 5 Times

Amy Gets Dogged 5 Times

Math texts, online classes, and more
for students in grades 5-12.

Engaging math books and online learning
for students ages 8-13.

Nationwide learning centers
for students in grades 2-12.

math training & tools
Alcumus
Videos
For the Win!
MATHCOUNTS Trainer
LaTeX TeXeR
MIT PRIMES/CrowdMath
Keep Learning

news & information
AoPS News
AoPS Wiki

contests on aops
AMC
MATHCOUNTS
Other Contests

emergency homeschool
Curriculum Recs
Podcast

Resources

Aops Wiki

2015 AMC 12B Problems/Problem 22

Art of Problem Solving is an

ACS WASC Accredited School

About Us
•
Contact Us
•
Terms
•
Privacy

Copyright © 2022 Art of Problem Solving
Six chairs are evenly spaced around a circular table. One person is seated in each chair. Each person gets up and sits down in a chair that is not the same and is not adjacent to the chair he or she originally occupied, so that again one person is seated in each chair. In how many ways can this be done?

Consider shifting every person over three seats (left or right) after each person has gotten up and sat back down again. Now, instead of each person being seated not in the same chair and not in an adjacent chair, each person will be seated either in the same chair or an adjacent chair. The problem now becomes the number of ways in which six people can sit down in a chair that is either the same chair or an adjacent chair in a circle.

Consider the similar problem of people sitting in a chair that is either the same chair or an adjacent chair in a row. Call the number of possibilities for this . Then if the leftmost person stays put, the problem is reduced to a row of chairs, and if the leftmost person shifts one seat to the right, the new person sitting in the leftmost seat must be the person originally second from the left, reducing the problem to a row of chairs. Thus, for . Clearly and , so , , and .

Now consider the six people in a circle and focus on one person. If that person stays put, the problem is reduced to a row of five chairs, for which there are possibilities. If that person moves one seat to the left, then the person who replaces him in his original seat will either be the person originally to the right of him, which will force everyone to simply shift over one seat to the left, or the person originally to the left of him, which reduces the problem to a row of four chairs, for which there are possibilities, giving possibilities in all. By symmetry, if that person moves one seat to the right, there are another possibilities, so we have a total of possibilities.

Label the people sitting at the table and assume that they are initially seated in the order . The possible new positions for and are respectively (a dash indicates a non-allowed position):

The permutations we are looking for should use one letter from each column, and there should not be any repeated letters:

We can represent each rearrangement as a permutation of the six elements in cycle notation. Note that any such permutation cannot have a 1-cycle, so the only possible types of permutations are 2,2,2-cycles, 4,2-cycles, 3,3-cycles, and 6-cycles. We deal with each case separately.

For 2,2,2-cycles, suppose that one of the 2-cycles switches the people across from each other, i.e. , , or . WLOG, we may assume it to be . Then we could either have both of the other 2-cycles be across from each other, giving the permutation or else neither of the other 2-cycles is across from each other, in which case the only possible permutation is . This can happen for and as well. So since the first permutation is not counted twice, we find a total of permutations that are 2,2,2-cycles where at least one of the 2-cycles switches people diametrically opposite from each other. Otherwise, since the elements in a 2-cycle cannot differ by 1, 3, or 5 mod 6, they must differ by 2 or 4 mod 6, i.e. they must be of the same parity. But since we have three odd and three even elements, this is impossible. Hence there are exactly 4 such permutations that are 2,2,2-cycles.

For 4,2-cycles, we assume for the moment that 1 is part of the 2-cycle. Then the 2-cycle can be , , or . The first two are essentially the same by symmetry, and we must arrange the elements 2, 4, 5, 6 into a 4-cycle. However, 5 must have two neighbors that are not next to it, which is impossible, hence the first two cases yield no permutations. If the 2-cycle is , then we must arrange the elements 2, 3, 5, 6 into a 4-cycle. Then 2 must have the neighbors 5 and 6. We find that the 4-cycles and satisfy the desired properties, yielding the permutations and . This can be done for the 2-cycles and as well, so we find a total of 6 such permutations that are 4,2-cycles.

For 3,3-cycles, note that if 1 neighbor 4, then the third element in the cycle will neighbor one of 1 and 4, so this is impossible. Therefore, the 3-cycle containing 1 must consist of elements 1, 3, and 5. Therefore, we obtain the four 3,3-cycles , , , and .

For 6-cycles, note that the neighbors of 1 can be 3 and 4, 3 and 5, or 4 and 5. In the first case, we may assume that it looks like -- the form is also possible but equivalent to this case. Then we must place the elements 2, 5, and 6. Note that 5 and 6 cannot go together, so 2 must go in between them. Also, 5 cannot neighbor 4, so we are left with one possibility, namely , which has an analogous possibility . In the second case, we assume that it looks like . The 2 must go next to the 5, and the 6 must go last (to neighbor the 3), so the only possibility here is , with the analogous possibility . In the final case, we may assume that it looks like . Then the 2 and 3 cannot go together, so the 6 must go in between them. Therefore, the only possibility is , with the analogous possibility . We have covered all possibilities for 6-cycles, and we have found 6 of them.

Therefore, there are such permutations.

Note that each person can't end up in his/her original seat, or either of the two adjacent seats. This means everyone must essentially "move across the table" to the other three seats. Notice we can recast the problem here into two steps:

1) First, everyone moves to the seat diametrically across their original seat

2) Second, everyone either stays put or moves to the chair to their immediate left or right (such that no two people attempt to sit together).

Note that the first step really does nothing, so we only have to consider the second step.
Now we can simply consider cases (Do this as an exercise; these cases are much simpler than the other solutions):

- The idea came from Jeremy Copeland

Notice the question is not any different than counting the cases if someone either stays put or moves one seat to the left or right (as in the above solution). WLOG, say the beginning case is ABCDEF (before any transformations). Thus, we can count these cases up:

Case 1: Everyone stays put.
Then, there is only one case (ABCDEF).

Case 2: Everyone moves.
Notice that if A moves to the right to B's seat, B has either two options. B can move to the left (to A's seat) or move to the right to C's seat. If B moves to C's seat, C cannot cancel the loop by going to A's seat, since we set the restriction as each person can only move ONE seat to the left/right. The only way to finish this process would be C moving to D, D moving to E, E moving to F, and F moving to A, achieving FABCDE as a case. Of course, A can move left and the same loop would occur but in the opposite direction (BCDEFA). Thus, we achieve two cases.

Case 3: The movement of seats cancel out each other.
If A moves to B's seat, B can move to A's seat, canceling the cycle. In this case, we would look to C, where this same thing could happen (note, however, that if C moves to D's seat, D cannot move to E's seat as the loop would be unachievable; furthermore, note that C cannot move to B's seat if A is already there since that would mean A would have to move to C's seat which is restricted).

We can count these cases by grouping each pair and then doing subcases:

Subcase 1: AB CD and EF are grouped.
Here we have 2*2*2 = 8 cases, but they cannot all stay put since we've already counted that possibility in Case 1, and thus there are 7 cases here.

Subcase 2: BC DE and FA are grouped.
Here again, we have 2*2*2 = 8 cases, and then subtract the overcounted case to get 7 cases.

Subcase 3: There is overlap so that two people do not change.
If A and B change seats, D and E could change seats, and this would not have been counted by the previous groupings (since its an odd parity grouping + an even parity grouping). Count this simply by listing out the cases, or notice that this just means the two people sitting three seats away not moving. There are three cases of that happening (A and D not moving, B and E not moving, and C and F not moving).

Look back at all our cases. Sum them up to get

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

Main Page

All Pages

Community

Interactive Maps

Recent Blog Posts

Season 1

Season 2

Season 3

Season 4

Season 5

Season 6

Season 7

Season 8

Season 9

Season 10

Amy Fleming

Ty Borden

Lou Fleming

Tim Fleming

Jack Bartlett

others

Heartland Ranch

Briar Ridge

Fairfield

Maggie's Diner

Hudson Vet Clinic

Main Page

All Pages

Community

Interactive Maps

Recent Blog Posts

Season 1

Season 2

Season 3

Season 4

Season 5

Season 6

Season 7

Season 8

Season 9

Season 10

Amy Fleming

Ty Borden

Lou Fleming

Tim Fleming

Jack Bartlett

others

Heartland Ranch

Briar Ridge

Fairfield

Maggie's Diner

Hudson Vet Clinic

Season 10

Season 1

Season 2

Season 3

Season 4

Season 5

Season 7

Season 8

Season 9

Season 11

Season 12

Season 13

Season 14

Season 15

The Sandman Will Keep You Awake - The Loop

Categories :

Episodes

Season 6

Seasons

Season 10

Season 1

Season 2

Season 3

Season 4

Season 5

Season 7

Season 8

Season 9

Season 11

Season 12

Season 13

Season 14

Season 15

Add category

Community content is available under CC-BY-SA unless otherwise noted.

More Heartland Wiki

1
Ty Borden

2
Amy Fleming

3
Georgie Fleming-Morris

Explore properties

Fandom

Cortex RPG

Muthead

Futhead

Fanatical

Follow Us

Overview

What is Fandom?

About

Careers

Press

Contact

Terms of Use

Privacy Policy

Global Sitemap

Local Sitemap

Community

Community Central

Support

Help

Do Not Sell My Info

Advertise

Media Kit

Fandomatic

Contact

Fandom Apps

Take your favorite fandoms with you and never miss a beat.

Heartland Wiki is a FANDOM TV Community.

Monumental Episodes - Here is a link to some important episodes.

Caleb's friend Bryce, a paralyzed military vet and ex-rodeo star, hires Amy to help sell his roping horse. However, Amy sees an opportunity to re-train both horse and rider, though she needs help to convince this proud and emotionally damaged cowboy that he can recapture his love for riding despite his injury. Tim shares a misunderstanding with Jack through a lack of communication which contributes to the interesting relationship between the two men. And Scott Cardinal drops by Heartland again, to check in on Ty and to say "hello" to Lou. And even Mallory returns to Heartland, to see Copper again.
As for the ever-expanding Lou, she meanwhile agrees to be Marnie's labour coach but being around Marnie's rambunctious toddler makes her wonder if she's really cut out for motherhood.

Amy and Ty work through their trust issues as they train a pair of Clydesdales, but it's an emergency at Heartland that reveals their true strength as a team when it matters most. Tim is still reeling from the knowledge that Shane is in fact his son but he finds himself bonding with the boy despite himself. Bad feelings resurface between Caleb and Val when he accuses her of manipulating Ashley and her decision to go away to the university.
Meanwhile, Lou's due date is still three weeks away. She's moody, uncomfortable and sick of being pregnant. She wants the baby now, but as the saying goes: "Be careful of what you wish for."

With the threat of losing Phoenix to Eric looming over their heads, things become even more complicated at Heartland when Georgie gets a surprise visit from her brother Jeff. When Jeff reveals the real reason for his visit the family is faced with the possibility of losing Georgie as well. With all the drama at home, Amy has second thoughts about going on a road trip to Las Vegas with Ty. Meanwhile, Peter suggests a life-changing idea to Lou that she finds impossible to wrap her head around and an increasingly stressed-out and overworked Jack ends his partnership with Tim—for good. The night of Georgie's birthday, the family wonders about an unusually late and absent Jack. On his drive into Heartland for Georgie's party, Tim spots something very concerning: Paint, riderless. He jumps out of his truck to find an unconscious Jack, face-down in the snow. The episode concludes with Tim frantically dialing emergency services to come to Jack's aid.

Amy discovers that a horse named Spartan is being abused at Mallen’s farm and convinces her mother Marion to rescue him. A storm on the way home sends their truck and trailer off the road. When Amy wakes up, she’s in the hospital and discovers that her mother died in the accident. Amy’s sister Lou comes home from New York to help. Refusing to put Spartan down, Grandpa Jack brings the horse back to Heartland hoping that Amy can help him. Before Amy can help Spartan she has to come to terms with what happened to her mom. A boy named Ty who was hired by Marion before she died comes to work at Heartland. He is on probation and Amy immediatel
Paige Nude Leaks
Mimi Faust Porn Video
Haniime

Amy Gets Dogged 5 Times

Report Page