Categories

# Understand the problem

How many integers between $100$ and $999$, inclusive, have the property that some permutation of its digits is a multiple of $11$ between $100$ and $999?$ ( For example, both $121$ and $211$ have this property. )

##### Source of the problem
American Mathematics Competition
##### Topic
Enumerative Combinatorics

7/10

##### Suggested Book
Introductory Combinatorics by Richard Brualdi

So, well have a long look at the problem. With a little bit of thought, you might even crack this without proceeding any further !

Stuck ?…No worries. Try asking yourself – How many numbers between 100-999 are exactly divisible by 11 ? This is quite easy to figure out.
What is the largest number in the range divisible by 11 ? Easy, 990.
How about the smallest such number ? Yeah, 110.
So, the number of integers in the range visible by 11 = ( ( 990110 ) / 11 ) + 1 = 81.
Now, how about you try taking things ahead from here onwards ?

Now see, 81 numbers are divisible by 11 in the range, as we just saw. All that’s left is to find out the permutations of these. Wait ! That’s simple, isn’t it ? Yes, 81 x 3 = 243. At this very juncture, ask yourself why. If you find out the answer to this “why”, you can might as well say you’ve gone far enough to solve the problem…

Let’s answer the “why” here. Say, we have a 3-digit number, abc. Now, ideally we would have had 6 permutations ( 3 ! simply ) for each such abc. But here’s a catch ! If abc is divisible by 11, so is cba.…!!! Yeah, that’s it. So, basically if we multiply by 6, we are accounting for same kind of permutations twice. So basically, each multiple of 11 in the range has it’s ( 6/2 ) = 3 permutations, that we are bothered about. This clearly justifies the fact that we can at maximum have 81 x 3 = 243 numbers in our desired solution set. But wait ? Why do I say, at maximum ? So…have we overcounted ? Yeah,we have. Why don’t you think about it…?

Well, as you might have felt, we did overcount. We did not account for the numbers where 0 could be one of the digits. We overcounted cases where the middle digit of the number is 0 and the last digit is 0. So, what are these ? Let’s find them out. In how many of the numbers is the last digit 0 ? That’s easy…they have a pattern. It goes like 110, 220,….990. That makes it 9. Now, in how many of those 243 numbers that we are bothered about, does ‘0’ occur as a middle digit ? With a little bit of insight, you’d find out they are 803, 902, 704, 605. And well their permutations too. So that makes it 4 x 2 = 8.  So, in total, 9+8 = 17 elements have been overcounted.

Subtract that from 243, ( 24317 ) = 226, that’s your answer.

# Connected Program at Cheenta

#### AMC Training Camp

One on One class for every student. Plus group sessions on advanced problem solving.

A  special training program for American Mathematics Contest.

# Similar Problems

## Value of Sum | PRMO – 2018 | Question 16

Try this Integer Problem from Number theory from PRMO 2018, Question 16 You may use sequential hints to solve the problem.

## Good numbers Problem | PRMO-2018 | Question 22

Try this good numbers Problem from Number theory from PRMO 2018, Question 22 You may use sequential hints to solve the problem.

## Polynomial Problem | PRMO-2018 | Question 30

Try this Integer Problem from Number theory from PRMO 2018, Question 30 You may use sequential hints to solve the problem.

## Digits Problem | PRMO – 2018 | Question 19

Try this Integer Problem from Number theory from PRMO 2018, Question 19 You may use sequential hints to solve the problem.

## External Tangent | AMC 10A, 2018 | Problem 15

Try this beautiful Problem on geometry based on circle from AMC 10A, 2018. Problem-15. You may use sequential hints to solve the problem.

## Dice Problem | AMC 10A, 2014| Problem No 17

Try this beautiful Problem on Probability from AMC 10A, 2014. Problem-17, You may use sequential hints to solve the problem.

## Problem on Curve | AMC 10A, 2018 | Problem 21

Try this beautiful Problem on Co-ordinate geometry from AMC 10A, 2018. Problem-21, You may use sequential hints to solve the problem.

## Right-angled Triangle | AMC 10A, 2018 | Problem No 16

Try this beautiful Problem on triangle from AMC 10A, 2018. Problem-16. You may use sequential hints to solve the problem.

## Finding Greatest Integer | AMC 10A, 2018 | Problem No 14

Try this beautiful Problem on Algebra from AMC 10A, 2018. Problem-14, You may use sequential hints to solve the problem.

## Length of the crease | AMC 10A, 2018 | Problem No 13

Try this beautiful Problem on triangle from AMC 10A, 2018. Problem-13. You may use sequential hints to solve the problem.
Categories

## AMC10/12 Combinatorics Problem

Combinatorics is one of the most important topic for the preparation of Mathematics Olympiad culture as well as American Mathematical Contest(also known as AMC). AMC10/12 Combinatorics Problem which is composed of selected problems from previous year.

## AMC 10

[Q.1]A scanning code consists of a $7 \times 7$$7 \times 7$ grid of squares, with some of its squares colored black and the rest colored white. There must be at least one square of each color in this grid of $49$$49$ squares. A scanning code is called $\text{symmetric}$$\text{symmetric}$ if its look does not change when the entire square is rotated by a multiple of $90 ^{\circ}$$90 ^{\circ}$ counterclockwise around its center, nor when it is reflected across a line joining opposite corners or a line joining midpoints of opposite sides. What is the total number of possible symmetric scanning codes?
$\textbf{(A)} \text{ 510} \qquad \textbf{(B)} \text{ 1022} \qquad \textbf{(C)} \text{ 8190} \qquad \textbf{(D)} \text{ 8192} \qquad \textbf{(E)} \text{ 65,534}$$\textbf{(A)} \text{ 510} \qquad \textbf{(B)} \text{ 1022} \qquad \textbf{(C)} \text{ 8190} \qquad \textbf{(D)} \text{ 8192} \qquad \textbf{(E)} \text{ 65,534}$
[Q.2]In the expression $\left(\underline{\qquad}\times\underline{\qquad}\right)+\left(\underline{\qquad}\times\underline{\qquad}\right)$$\left(\underline{\qquad}\times\underline{\qquad}\right)+\left(\underline{\qquad}\times\underline{\qquad}\right)$ each blank is to be filled in with one of the digits $1,2,3,$$1,2,3,$ or $4,$$4,$ with each digit being used once. How many different values can be obtained?
$\textbf{(A) }2 \qquad \textbf{(B) }3\qquad \textbf{(C) }4 \qquad \textbf{(D) }6 \qquad \textbf{(E) }24 \qquad$$\textbf{(A) }2 \qquad \textbf{(B) }3\qquad \textbf{(C) }4 \qquad \textbf{(D) }6 \qquad \textbf{(E) }24 \qquad$
[Q.3]How many subsets of $\{2,3,4,5,6,7,8,9\}$$\{2,3,4,5,6,7,8,9\}$ contain at least one prime number?
$\textbf{(A)} \text{ 128} \qquad \textbf{(B)} \text{ 192} \qquad \textbf{(C)} \text{ 224} \qquad \textbf{(D)} \text{ 240} \qquad \textbf{(E)} \text{ 256}$$\textbf{(A)} \text{ 128} \qquad \textbf{(B)} \text{ 192} \qquad \textbf{(C)} \text{ 224} \qquad \textbf{(D)} \text{ 240} \qquad \textbf{(E)} \text{ 256}$
[Q.4]A list of $2018$$2018$ positive integers has a unique mode, which occurs exactly $10$$10$ times. What is the least number of distinct values that can occur in the list?
$\textbf{(A)}\ 202\qquad\textbf{(B)}\ 223\qquad\textbf{(C)}\ 224\qquad\textbf{(D)}\ 225\qquad\textbf{(E)}\ 234$$\textbf{(A)}\ 202\qquad\textbf{(B)}\ 223\qquad\textbf{(C)}\ 224\qquad\textbf{(D)}\ 225\qquad\textbf{(E)}\ 234$
[Q.5]At a gathering of $30$$30$ people, there are $20$$20$ people who all know each other and $10$$10$ people who know no one. People who know each other hug, and people who do not know each other shake hands. How many handshakes occur within the group?
$\textbf{(A)}\ 240\qquad\textbf{(B)}\ 245\qquad\textbf{(C)}\ 290\qquad\textbf{(D)}\ 480\qquad\textbf{(E)}\ 490$$\textbf{(A)}\ 240\qquad\textbf{(B)}\ 245\qquad\textbf{(C)}\ 290\qquad\textbf{(D)}\ 480\qquad\textbf{(E)}\ 490$
[Q.6]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 5 chairs under these conditions?
$\textbf{(A)}\ 12\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 28\qquad\textbf{(D)}\ 32\qquad\textbf{(E)}\ 40$$\textbf{(A)}\ 12\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 28\qquad\textbf{(D)}\ 32\qquad\textbf{(E)}\ 40$
[Q.7]How many integers between $100$$100$ and $999$$999$, inclusive, have the property that some permutation of its digits is a multiple of $11$$11$ between $100$$100$ and $999$$999$? For example, both $121$$121$ and $211$$211$ have this property.
$\mathrm{\textbf{(A)} \ }226\qquad \mathrm{\textbf{(B)} \ } 243 \qquad \mathrm{\textbf{(C)} \ } 270 \qquad \mathrm{\textbf{(D)} \ }469\qquad \mathrm{\textbf{(E)} \ } 486$$\mathrm{\textbf{(A)} \ }226\qquad \mathrm{\textbf{(B)} \ } 243 \qquad \mathrm{\textbf{(C)} \ } 270 \qquad \mathrm{\textbf{(D)} \ }469\qquad \mathrm{\textbf{(E)} \ } 486$
[Q.8]There are $20$$20$ students participating in an after-school program offering classes in yoga, bridge, and painting. Each student must take at least one of these three classes, but may take two or all three. There are $10$$10$ students taking yoga, $13$$13$ taking bridge, and $9$$9$ taking painting. There are $9$ students taking at least two classes. How many students are taking all three classes?
$\textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ 5$$\textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ 5$
[Q.9]How many of the base-ten numerals for the positive integers less than or equal to $2017$$2017$ contain the digit $0$$0$?
$\textbf{(A)}\ 469\qquad\textbf{(B)}\ 471\qquad\textbf{(C)}\ 475\qquad\textbf{(D)}\ 478\qquad\textbf{(E)}\ 481$$\textbf{(A)}\ 469\qquad\textbf{(B)}\ 471\qquad\textbf{(C)}\ 475\qquad\textbf{(D)}\ 478\qquad\textbf{(E)}\ 481$
[Q.10]In the figure below, $3$$3$ of the $6$$6$ disks are to be painted blue, $2$$2$  are to be painted red, and $1$$1$ is to be painted green. Two paintingsthat can be obtained from one another by a rotation or a reflection of the entire figure are considered the same. How many different paintings are possible?
$\textbf{(A)}\ 6\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 12\qquad\textbf{(E)}\ 15$$\textbf{(A)}\ 6\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 12\qquad\textbf{(E)}\ 15$
[Q.11]How many of the base-ten numerals for the positive integers less than or equal to $2017$$2017$ contain the digit $0$$0$?
$\textbf{(A)}\ 1024\qquad\textbf{(B)}\ 1524\qquad\textbf{(C)}\ 1533\qquad\textbf{(D)}\ 1536\qquad\textbf{(E)}\ 2048$$\textbf{(A)}\ 1024\qquad\textbf{(B)}\ 1524\qquad\textbf{(C)}\ 1533\qquad\textbf{(D)}\ 1536\qquad\textbf{(E)}\ 2048$
[Q.12]Each vertex of a cube is to be labeled with an integer $1$$1$ through $8$$8$,with each integer being used once, in such a way that the sum of the four numbers on the vertices of a face is the same for each face. Arrangements that can be obtained from each other through rotations of the cube are considered to be the same. How many different arrangements are possible?
$\textbf{(A) } 1\qquad\textbf{(B) } 3\qquad\textbf{(C) }6 \qquad\textbf{(D) }12 \qquad\textbf{(E) }24$$\textbf{(A) } 1\qquad\textbf{(B) } 3\qquad\textbf{(C) }6 \qquad\textbf{(D) }12 \qquad\textbf{(E) }24$
[Q.13]Five friends sat in a movie theater in a row containing $5$$5$ seats, numbered $1$$1$ to $5$ from left to right. (The directions "left" and "right" are from the point of view of the people as they sit in the seats.) During the movie Ada went to the lobby to get some popcorn. When she returned, she found that Bea had moved two seats to the right, Ceci had moved one seat to the left, and Dee and Edie had switched seats, leaving an end seat for Ada. In which seat had Ada been sitting before she got up?
$\textbf{(A) }1 \qquad \textbf{(B) } 2 \qquad \textbf{(C) } 3 \qquad \textbf{(D) } 4\qquad \textbf{(E) } 5$$\textbf{(A) }1 \qquad \textbf{(B) } 2 \qquad \textbf{(C) } 3 \qquad \textbf{(D) } 4\qquad \textbf{(E) } 5$
[Q.14]Erin the ant starts at a given corner of a cube and crawls along exactly $7$$7$ edges in such a way that she visits every corner exactly once. and then finds that she is unable to return along an edge to her starting point. How many paths are there meeting these conditions?
$\textbf{(A) }\text{6}\qquad\textbf{(B) }\text{9}\qquad\textbf{(C) }\text{12}\qquad\textbf{(D) }\text{18}\qquad\textbf{(E) }\text{24}$$\textbf{(A) }\text{6}\qquad\textbf{(B) }\text{9}\qquad\textbf{(C) }\text{12}\qquad\textbf{(D) }\text{18}\qquad\textbf{(E) }\text{24}$
[Q.15]Walking down Jane Street, Ralph passed four houses in a row, each painted a different color. He passed the orange house before the red house, and he passed the blue house before the yellow house. The blue house was not next to the yellow house. How many orderings of the colored houses are possible?
$\textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 6$$\textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 6$
[Q.16]The numbers $1, 2, 3, 4, 5$$1, 2, 3, 4, 5$ are to be arranged in a circle. An arrangement is $\textit{bad}$$\textit{bad}$ if it is not true that for every $n$$n$ from $1$$1$ to $15$$15$ one can find a subset of the numbers that appear consecutively on the circle that sum to $n$$n$. Arrangements that differ only by a rotation or a reflection are considered the same. How many different bad arrangements are there?
$\textbf {(A) } 1 \qquad \textbf {(B) } 2 \qquad \textbf {(C) } 3 \qquad \textbf {(D) } 4 \qquad \textbf {(E) } 5$$\textbf {(A) } 1 \qquad \textbf {(B) } 2 \qquad \textbf {(C) } 3 \qquad \textbf {(D) } 4 \qquad \textbf {(E) } 5$
[Q.17]A student must choose a program of four courses from a menu of courses consisting of English, Algebra, Geometry, History, Art, and Latin. This program must contain English and at least one mathematics course. In how many ways can this program be chosen?
$\textbf{(A)}\ 6\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 12\qquad\textbf{(E)}\ 16$$\textbf{(A)}\ 6\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 12\qquad\textbf{(E)}\ 16$
[Q.18]A student council must select a two-person welcoming committee and a three-person planning committee from among its members. There are exactly $10$$10$ ways to select a two-person team for the welcoming committee. It is possible for students to serve on both committees. In how many different ways can a three-person planning committee be selected?
$\textbf{(A)}\ 10\qquad\textbf{(B)}\ 12\qquad\textbf{(C)}\ 15\qquad\textbf{(D)}\ 18\qquad\textbf{(E)}\ 25$$\textbf{(A)}\ 10\qquad\textbf{(B)}\ 12\qquad\textbf{(C)}\ 15\qquad\textbf{(D)}\ 18\qquad\textbf{(E)}\ 25$
[Q.19]Central High School is competing against Northern High School in a backgammon match. Each school has three players, and the contest rules require that each player play two games against each of the other school's players. The match takes place in six rounds, with three games played simultaneously in each round. In how many different ways can the match be scheduled?
$\textbf{(A)}\ 540\qquad\textbf{(B)}\ 600\qquad\textbf{(C)}\ 720\qquad\textbf{(D)}\ 810\qquad\textbf{(E)}\ 900$$\textbf{(A)}\ 540\qquad\textbf{(B)}\ 600\qquad\textbf{(C)}\ 720\qquad\textbf{(D)}\ 810\qquad\textbf{(E)}\ 900$
[Q.20]All $20$$20$ diagonals are drawn in a regular octagon. At how many distinct points in the interior of the octagon (not on the boundary) do two or more diagonals intersect?
$\textbf{(A)}\ 49\qquad\textbf{(B)}\ 65\qquad\textbf{(C)}\ 70\qquad\textbf{(D)}\ 96\qquad\textbf{(E)}\ 128$$\textbf{(A)}\ 49\qquad\textbf{(B)}\ 65\qquad\textbf{(C)}\ 70\qquad\textbf{(D)}\ 96\qquad\textbf{(E)}\ 128$
[Q.21]Chubby makes nonstandard checkerboards that have $31$ squares on each side. The checkerboards have a black square in every corner and alternate red and black squares along every row and column. How many black squares are there on such a checkerboard?
$\textbf{(A)}\ 480 \qquad\textbf{(B)}\ 481 \qquad\textbf{(C)}\ 482 \qquad\textbf{(D)}\ 483 \qquad\textbf{(E)}\ 484$$\textbf{(A)}\ 480 \qquad\textbf{(B)}\ 481 \qquad\textbf{(C)}\ 482 \qquad\textbf{(D)}\ 483 \qquad\textbf{(E)}\ 484$
[Q.22]Adam, Benin, Chiang, Deshawn, Esther, and Fiona have internet accounts. Some, but not all, of them are internet friends with each other, and none of them has an internet friend outside this group. Each of them has the same number of internet friends. In how many different ways can this happen?
$\text{(A)}\ 60\qquad\text{(B)}\ 170\qquad\text{(C)}\ 290\qquad\text{(D)}\ 320\qquad\text{(E)}\ 660$$\text{(A)}\ 60\qquad\text{(B)}\ 170\qquad\text{(C)}\ 290\qquad\text{(D)}\ 320\qquad\text{(E)}\ 660$
[Q.23]A dessert chef prepares the dessert for every day of a week starting with Sunday. The dessert each day is either cake, pie, ice cream, or pudding. The same dessert may not be served two days in a row. There must be cake on Friday because of a birthday. How many different dessert menus for the week are possible?
$\textbf{(A)}\ 729\qquad\textbf{(B)}\ 972\qquad\textbf{(C)}\ 1024\qquad\textbf{(D)}\ 2187\qquad\textbf{(E)}\ 2304$$\textbf{(A)}\ 729\qquad\textbf{(B)}\ 972\qquad\textbf{(C)}\ 1024\qquad\textbf{(D)}\ 2187\qquad\textbf{(E)}\ 2304$
[Q.24]In a round-robin tournament with 6 teams, each team plays one game against each other team, and each game results in one team winning and one team losing. At the end of the tournament, the teams are ranked by the number of games won. What is the maximum number of teams that could be tied for the most wins at the end on the tournament?
$\textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 6$$\textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 6$
[Q.25]Let ($a_1$$a_1$, $a_2$, ... $a_{10}$) be a list of the first 10 positive integers such that for each $2\le$$2\le$ $i$$i$ $\le10$$\le10$ either $a_i + 1$$a_i + 1$ or $a_i-1$$a_i-1$ or both appear somewhere before $a_i$$a_i$ in the list. How many such lists are there?
$\textbf{(A)}\ \ 120\qquad\textbf{(B)}\ 512\qquad\textbf{(C)}\ \ 1024\qquad\textbf{(D)}\ 181,440\qquad\textbf{(E)}\ \ 362,880$$\textbf{(A)}\ \ 120\qquad\textbf{(B)}\ 512\qquad\textbf{(C)}\ \ 1024\qquad\textbf{(D)}\ 181,440\qquad\textbf{(E)}\ \ 362,880$
[Q.26]Amy, Beth, and Jo listen to four different songs and discuss which ones they like. No song is liked by all three. Furthermore, for each of the three pairs of the girls, there is at least one song liked by those two girls but disliked by the third. In how many different ways is this possible?
$\textbf{(A)}\ 108\qquad\textbf{(B)}\ 132\qquad\textbf{(C)}\ 671\qquad\textbf{(D)}\ 846\qquad\textbf{(E)}\ 1105$$\textbf{(A)}\ 108\qquad\textbf{(B)}\ 132\qquad\textbf{(C)}\ 671\qquad\textbf{(D)}\ 846\qquad\textbf{(E)}\ 1105$
[Q.27]How many even integers are there between 200 and 700 whose digits are all different and come from the set $\{1,2,5,7,8,9\}$$\{1,2,5,7,8,9\}$ ?
$\text{(A)}\,12 \qquad\text{(B)}\,20 \qquad\text{(C)}\,72 \qquad\text{(D)}\,120 \qquad\text{(E)}\,200$$\text{(A)}\,12 \qquad\text{(B)}\,20 \qquad\text{(C)}\,72 \qquad\text{(D)}\,120 \qquad\text{(E)}\,200$
[Q.28]Each vertex of convex pentagon $ABCDE$$ABCDE$ is to be assigned a color. There are $6$$6$ colors to choose from, and the ends of each diagonal must have different colors. How many different colorings are possible?
$\textbf{(A)}\ 2520\qquad\textbf{(B)}\ 2880\qquad\textbf{(C)}\ 3120\qquad\textbf{(D)}\ 3250\qquad\textbf{(E)}\ 3750$$\textbf{(A)}\ 2520\qquad\textbf{(B)}\ 2880\qquad\textbf{(C)}\ 3120\qquad\textbf{(D)}\ 3250\qquad\textbf{(E)}\ 3750$
[Q.29]Seven distinct pieces of candy are to be distributed among three bags. The red bag and the blue bag must each receive at least one piece of candy; the white bag may remain empty. How many arrangements are possible?
$\textbf{(A)}\ 1930 \qquad \textbf{(B)}\ 1931 \qquad \textbf{(C)}\ 1932 \qquad \textbf{(D)}\ 1933 \qquad \textbf{(E)}\ 1934$$\textbf{(A)}\ 1930 \qquad \textbf{(B)}\ 1931 \qquad \textbf{(C)}\ 1932 \qquad \textbf{(D)}\ 1933 \qquad \textbf{(E)}\ 1934$
[Q.30]Two subsets of the set $S=\lbrace a,b,c,d,e\rbrace$$S=\lbrace a,b,c,d,e\rbrace$ are to be chosen so that their union is $S$$S$ and their intersection contains exactly two elements. In how many ways can this be done, assuming that the order in which the subsets are chosen does not matter?
$\mathrm{(A)}\ 20\qquad\mathrm{(B)}\ 40\qquad\mathrm{(C)}\ 60\qquad\mathrm{(D)}\ 160\qquad\mathrm{(E)}\ 320$$\mathrm{(A)}\ 20\qquad\mathrm{(B)}\ 40\qquad\mathrm{(C)}\ 60\qquad\mathrm{(D)}\ 160\qquad\mathrm{(E)}\ 320$
[Q.31]Ten chairs are evenly spaced around a round table and numbered clockwise from $1$$1$ through $10$$10$. Five married couples are to sit in the chairs with men and women alternating, and no one is to sit either next to or across from his/her spouse. How many seating arrangements are possible?
$\mathrm{(A)}\ 240\qquad\mathrm{(B)}\ 360\qquad\mathrm{(C)}\ 480\qquad\mathrm{(D)}\ 540\qquad\mathrm{(E)}\ 720$$\mathrm{(A)}\ 240\qquad\mathrm{(B)}\ 360\qquad\mathrm{(C)}\ 480\qquad\mathrm{(D)}\ 540\qquad\mathrm{(E)}\ 720$

## AMC 12

[Q.32]How many subsets of  $\{2,3,4,5,6,7,8,9\}$$\{2,3,4,5,6,7,8,9\}$ contain at least one prime number?
$(\text{A}) \indent 128 \qquad (\text{B}) \indent 192 \qquad (\text{C}) \indent 224 \qquad (\text{D}) \indent 240 \qquad (\text{E}) \indent 256$$(\text{A}) \indent 128 \qquad (\text{B}) \indent 192 \qquad (\text{C}) \indent 224 \qquad (\text{D}) \indent 240 \qquad (\text{E}) \indent 256$
[Q.33]A set of $n$$n$ people participate in an online video basketball tournament. Each person may be a member of any number of $5$$5$-player teams, but no two teams may have exactly the same $5$$5$ members. The site statistics show a curious fact: The average, over all subsets of size< $9$ of the set of $n$ participants, of the number of complete teams whose members are among those $9$$9$ people is equal to the reciprocal of the average, over all subsets of size $8$$8$ of the set of $n$$n$ participants, of the number of complete teams whose members are among those $8$$8$ people. How many values $n$$n$,  $9\leq n\leq 2017$$9\leq n\leq 2017$, can be the number of participants?
$\textbf{(A) } 477 \qquad \textbf{(B) } 482 \qquad \textbf{(C) } 487 \qquad \textbf{(D) } 557 \qquad \textbf{(E) } 562$$\textbf{(A) } 477 \qquad \textbf{(B) } 482 \qquad \textbf{(C) } 487 \qquad \textbf{(D) } 557 \qquad \textbf{(E) } 562$
[Q.34]A set of teams held a round-robin tournament in which every team played every other team exactly once. Every team won $10$$10$ games and lost $10$$10$ games; there were no ties. How many sets of three teams $\{A, B, C\}$$\{A, B, C\}$ were there in which $A$$A$ beat $B$$B$, $B$$B$ beat $C$$C$, and $C$$C$ beat $A?$$A?$
$\textbf{(A)}\ 385 \qquad \textbf{(B)}\ 665 \qquad \textbf{(C)}\ 945 \qquad \textbf{(D)}\ 1140 \qquad \textbf{(E)}\ 1330$$\textbf{(A)}\ 385 \qquad \textbf{(B)}\ 665 \qquad \textbf{(C)}\ 945 \qquad \textbf{(D)}\ 1140 \qquad \textbf{(E)}\ 1330$
[Q.35]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 chair 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?$ $\textbf{(A)}\; 14 \qquad\textbf{(B)}\; 16 \qquad\textbf{(C)}\; 18 \qquad\textbf{(D)}\; 20 \qquad\textbf{(E)}\; 24$$\textbf{(A)}\; 14 \qquad\textbf{(B)}\; 16 \qquad\textbf{(C)}\; 18 \qquad\textbf{(D)}\; 20 \qquad\textbf{(E)}\; 24$ [Q.36]A fancy bed and breakfast inn has $5$$5$ rooms, each with a distinctive color-coded decor. One day $5$$5$ friends arrive to spend the night. There are no other guests that night. The friends can room in any combination they wish, but with no more than $2$$2$ friends per room. In how many ways can the innkeeper assign the guests to the rooms?$
$\textbf{(A) }2100\qquad \textbf{(B) }2220\qquad \textbf{(C) }3000\qquad \textbf{(D) }3120\qquad \textbf{(E) }3125\qquad$$\textbf{(A) }2100\qquad \textbf{(B) }2220\qquad \textbf{(C) }3000\qquad \textbf{(D) }3120\qquad \textbf{(E) }3125\qquad$
[Q.37]Rabbits Peter and Pauline have three offspring—Flopsie, Mopsie, and Cotton-tail. These five rabbits are to be distributed to four different pet stores so that no store gets both a parent and a child. It is not required that every store gets a rabbit. In how many different ways can this be done?$ $\textbf{(A)} \ 96 \qquad \textbf{(B)} \ 108 \qquad \textbf{(C)} \ 156 \qquad \textbf{(D)} \ 204 \qquad \textbf{(E)} \ 372$$\textbf{(A)} \ 96 \qquad \textbf{(B)} \ 108 \qquad \textbf{(C)} \ 156 \qquad \textbf{(D)} \ 204 \qquad \textbf{(E)} \ 372$ [Q.38]Let $(a_1,a_2, \dots ,a_{10})$$(a_1,a_2, \dots ,a_{10})$ be a list of the first 10 positive integers such that for each $2 \le i \le 10$$2 \le i \le 10$ either $a_i+1$$a_i+1$ or $a_i-1$$a_i-1$ or both appear somewhere before $a_i$$a_i$ in the list. How many such lists are there$ ?
$\textbf{(A)}\ 120\qquad\textbf{(B)}\ 512\qquad\textbf{(C)}\ 1024\qquad\textbf{(D)}\ 181,440\qquad\textbf{(E)}\ 362,880$$\textbf{(A)}\ 120\qquad\textbf{(B)}\ 512\qquad\textbf{(C)}\ 1024\qquad\textbf{(D)}\ 181,440\qquad\textbf{(E)}\ 362,880$
[Q.39]How many positive integers less than $1000$$1000$ are $6$$6$ times the sum of their digits$? $\textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 12$$\textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 12$ [Q.40]Ten women sit in $10$$10$ seats in a line. All of the $10$$10$ get up and then reseat themselves using all $10$$10$ seats, each sitting in the seat she was in before or a seat next to the one she occupied before. In how many ways can the women be reseated$ ?
$\textbf{(A)}\ 89\qquad \textbf{(B)}\ 90\qquad \textbf{(C)}\ 120\qquad \textbf{(D)}\ 2^{10}\qquad \textbf{(E)}\ 2^2 3^8$$\textbf{(A)}\ 89\qquad \textbf{(B)}\ 90\qquad \textbf{(C)}\ 120\qquad \textbf{(D)}\ 2^{10}\qquad \textbf{(E)}\ 2^2 3^8$