# Difference between revisions of "2012 AMC 10A Problems/Problem 23"

(Created page with "== Problem 23 == 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 a...") |
Talkinaway (talk | contribs) (!) |
||

Line 4: | Line 4: | ||

<math> \textbf{(A)}\ 60\qquad\textbf{(B)}\ 170\qquad\textbf{(C)}\ 290\qquad\textbf{(D)}\ 320\qquad\textbf{(E)}\ 660 </math> | <math> \textbf{(A)}\ 60\qquad\textbf{(B)}\ 170\qquad\textbf{(C)}\ 290\qquad\textbf{(D)}\ 320\qquad\textbf{(E)}\ 660 </math> | ||

+ | |||

+ | == Solution == | ||

+ | |||

+ | Note that if <math>n</math> is the number of friends each person has, then <math>n</math> can be any integer from <math>1</math> to <math>4</math>, inclusive. | ||

+ | |||

+ | Also note that the cases of <math>n=1</math> and <math>n=4</math> are the same, since a map showing a solution for <math>n=1</math> can correspond one-to-one with a map of a solution for <math>n=4</math> by simply making every pair of friends non-friends and vice versa. The same can be said of configurations with <math>n=2</math> when compared to configurations of <math>n=3</math>. Thus, we have two cases to examine, <math>n=1</math> and <math>n=2</math>, and we count each of these combinations twice. | ||

+ | |||

+ | For <math>n=1</math>, if everyone has exactly one friend, that means there must be <math>3</math> pairs of friends, with no other interconnections. The first person has <math>5</math> choices for a friend. There are <math>4</math> people left. The next person has <math>3</math> choices for a friend. There are two people left, and these remaining two must be friends. Thus, there are <math>15</math> configurations with <math>n=1</math>. | ||

+ | |||

+ | For <math>n=2</math>, there are two possibilities. The group of <math>6</math> can be split into two groups of <math>3</math>, with each group creating a "friendship triangle." The first person has <math>\binom{5}{2} = 10</math> ways to pick two friends from the other five, while the other three are forced together. Thus, there are <math>10</math> triangular configurations. | ||

+ | |||

+ | However, the group can also from a "friendship hexagon", with each person sitting on a vertex, and each side representing the two friends that person has. The first person may be seated anywhere on the hexagon [[WLOG]]. This person has <math>\binom{5}{2} = 10</math> choices for the two friends on the adjoining vertices. Each of the three remaining people can be seated "across" from one of the original three people, forming a different configuration. Thus, there are <math>10 \cdot 3! = 60</math> hexagonal configurations, and in total <math>70</math> configurations for <math>n=2</math>. | ||

+ | |||

+ | As stated before, <math>n=3</math> has <math>70</math> configurations, and <math>n=4</math> has <math>15</math> configurations. This gives a total of <math>(70 + 15)\cdot 2 = 170</math> configurations, which is option <math>\textbf{(B)}</math> |

## Revision as of 01:12, 9 February 2012

## Problem 23

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?

## Solution

Note that if is the number of friends each person has, then can be any integer from to , inclusive.

Also note that the cases of and are the same, since a map showing a solution for can correspond one-to-one with a map of a solution for by simply making every pair of friends non-friends and vice versa. The same can be said of configurations with when compared to configurations of . Thus, we have two cases to examine, and , and we count each of these combinations twice.

For , if everyone has exactly one friend, that means there must be pairs of friends, with no other interconnections. The first person has choices for a friend. There are people left. The next person has choices for a friend. There are two people left, and these remaining two must be friends. Thus, there are configurations with .

For , there are two possibilities. The group of can be split into two groups of , with each group creating a "friendship triangle." The first person has ways to pick two friends from the other five, while the other three are forced together. Thus, there are triangular configurations.

However, the group can also from a "friendship hexagon", with each person sitting on a vertex, and each side representing the two friends that person has. The first person may be seated anywhere on the hexagon WLOG. This person has choices for the two friends on the adjoining vertices. Each of the three remaining people can be seated "across" from one of the original three people, forming a different configuration. Thus, there are hexagonal configurations, and in total configurations for .

As stated before, has configurations, and has configurations. This gives a total of configurations, which is option