Difference between revisions of "2013 AMC 10B Problems/Problem 22"
Firebolt360 (talk | contribs) (→Solution 2) |
Firebolt360 (talk | contribs) (→Solution 1) |
||
| Line 45: | Line 45: | ||
==Solution 1== | ==Solution 1== | ||
| + | <asy> | ||
| + | pair A,B,C,D,E,F,G,H,J; | ||
| + | A=(20,20(2+sqrt(2))); | ||
| + | B=(20(1+sqrt(2)),20(2+sqrt(2))); | ||
| + | C=(20(2+sqrt(2)),20(1+sqrt(2))); | ||
| + | D=(20(2+sqrt(2)),20); | ||
| + | E=(20(1+sqrt(2)),0); | ||
| + | F=(20,0); | ||
| + | G=(0,20); | ||
| + | H=(0,20(1+sqrt(2))); | ||
| + | J=(10(2+sqrt(2)),10(2+sqrt(2))); | ||
| + | draw(A--B); | ||
| + | draw(B--C); | ||
| + | draw(C--D); | ||
| + | draw(D--E); | ||
| + | draw(E--F); | ||
| + | draw(F--G); | ||
| + | draw(G--H); | ||
| + | draw(H--A); | ||
| + | dot(A); | ||
| + | dot(B); | ||
| + | dot(C); | ||
| + | dot(D); | ||
| + | dot(E); | ||
| + | dot(F); | ||
| + | dot(G); | ||
| + | dot(H); | ||
| + | dot(J); | ||
| + | label("A",A,NNW); | ||
| + | label("B",B,NNE); | ||
| + | label("C",C,ENE); | ||
| + | label("D",D,ESE); | ||
| + | label("E",E,SSE); | ||
| + | label("F",F,SSW); | ||
| + | label("G",G,WSW); | ||
| + | label("H",H,WNW); | ||
| + | label("J",J,SE); | ||
| + | </asy> | ||
| − | First of all, note that <math>J</math> must be <math>1</math>, <math>5</math>, or <math>9</math> to preserve symmetry, since the sum of 1 to 9 is 45, and we need the remaining 8 to be divisible by 4 (otherwise we will have uneven sums). We also notice that <math>A+E = B+F = C+G = D+H</math>. | + | First of all, note that <math>J</math> must be <math>1</math>, <math>5</math>, or <math>9</math> to preserve symmetry, since the sum of 1 to 9 is 45, and we need the remaining 8 to be divisible by 4 (otherwise we will have uneven sums). So, we have: |
| + | |||
| + | <asy> | ||
| + | pair A,B,C,D,E,F,G,H,J; | ||
| + | A=(20,20(2+sqrt(2))); | ||
| + | B=(20(1+sqrt(2)),20(2+sqrt(2))); | ||
| + | C=(20(2+sqrt(2)),20(1+sqrt(2))); | ||
| + | D=(20(2+sqrt(2)),20); | ||
| + | E=(20(1+sqrt(2)),0); | ||
| + | F=(20,0); | ||
| + | G=(0,20); | ||
| + | H=(0,20(1+sqrt(2))); | ||
| + | J=(10(2+sqrt(2)),10(2+sqrt(2))); | ||
| + | draw(A--B); | ||
| + | draw(B--C); | ||
| + | draw(C--D); | ||
| + | draw(D--E); | ||
| + | draw(E--F); | ||
| + | draw(F--G); | ||
| + | draw(G--H); | ||
| + | draw(H--A); | ||
| + | dot(A); | ||
| + | dot(B); | ||
| + | dot(C); | ||
| + | dot(D); | ||
| + | dot(E); | ||
| + | dot(F); | ||
| + | dot(G); | ||
| + | dot(H); | ||
| + | dot(J); | ||
| + | label("A",A,NNW); | ||
| + | label("B",B,NNE); | ||
| + | label("C",C,ENE); | ||
| + | label("D",D,ESE); | ||
| + | label("E",E,SSE); | ||
| + | label("F",F,SSW); | ||
| + | label("G",G,WSW); | ||
| + | label("H",H,WNW); | ||
| + | label("J $(1, 5, 9)$",J,SE); | ||
| + | </asy> | ||
| + | |||
| + | We also notice that <math>A+E = B+F = C+G = D+H</math>. | ||
Assume that <math>J = 1</math>. Thus the pairs of vertices must be <math>9</math> and <math>2</math>, <math>8</math> and <math>3</math>, <math>7</math> and <math>4</math>, and <math>6</math> and <math>5</math>. There are <math>4! = 24</math> ways to assign these to the vertices. Furthermore, there are <math>2^{4} = 16</math> ways to switch them (i.e. do <math>2</math> <math>9</math> instead of <math>9</math> <math>2</math>). | Assume that <math>J = 1</math>. Thus the pairs of vertices must be <math>9</math> and <math>2</math>, <math>8</math> and <math>3</math>, <math>7</math> and <math>4</math>, and <math>6</math> and <math>5</math>. There are <math>4! = 24</math> ways to assign these to the vertices. Furthermore, there are <math>2^{4} = 16</math> ways to switch them (i.e. do <math>2</math> <math>9</math> instead of <math>9</math> <math>2</math>). | ||
Revision as of 16:57, 2 January 2019
Contents
Problem
The regular octagon
has its center at
. Each of the vertices and the center are to be associated with one of the digits
through
, with each digit used once, in such a way that the sums of the numbers on the lines
,
,
, and
are all equal. In how many ways can this be done?
Solution 1
First of all, note that
must be
,
, or
to preserve symmetry, since the sum of 1 to 9 is 45, and we need the remaining 8 to be divisible by 4 (otherwise we will have uneven sums). So, we have:
We also notice that
.
Assume that
. Thus the pairs of vertices must be
and
,
and
,
and
, and
and
. There are
ways to assign these to the vertices. Furthermore, there are
ways to switch them (i.e. do
instead of
).
Thus, there are
ways for each possible J value. There are
possible J values that still preserve symmetry:
Solution 2
As in solution 1,
must be
,
, or
giving us 3 choices. Additionally
. This means once we choose
there are
remaining choices. Going clockwise from
we count,
possibilities for
. Choosing
also determines
which leaves
choices for
, once
is chosen it also determines
leaving
choices for
. Once
is chosen it determines
leaving
choices for
. Choosing
determines
, exhausting the numbers. Additionally, there are three possible values for
. To get the answer we multiply
.
See also
| 2013 AMC 10B (Problems • Answer Key • Resources) | ||
| Preceded by Problem 21 |
Followed by Problem 23 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
| All AMC 10 Problems and Solutions | ||
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions.