Difference between revisions of "2001 AMC 12 Problems/Problem 6"

(Solution)
m (Solution 2)
 
(11 intermediate revisions by 4 users not shown)
Line 10: Line 10:
 
<math>\textbf{(A)}\ 4\qquad \textbf{(B)}\ 5\qquad \textbf{(C)}\ 6\qquad \textbf{(D)}\ 7\qquad \textbf{(E)}\ 8</math>
 
<math>\textbf{(A)}\ 4\qquad \textbf{(B)}\ 5\qquad \textbf{(C)}\ 6\qquad \textbf{(D)}\ 7\qquad \textbf{(E)}\ 8</math>
  
If A is odd, it must be either 9 or 1. Because it cannot be either of these values, A is even. For that reason, B and D can be eliminated. From observing trends in DEF, it can be concluded that A must be either 6 or 8. Therefore, A can be eliminated. From observing trends in GHIJ, B or C cannot be 7,5 or 3. B or C can only be 9 or 1. Because B nor C can be 9. C must be 1. If C is 1, than B can be either 0 or 2. If B is 2, then DEF must be 468. Because 6 is already taken as the value of A, then B cannot be 2. This means B is 0. This leads us to the ultimate conclusion that A is equivalent to 8.
+
== Solution ==
 +
 
 +
We start by noting that there are <math>10</math> letters, meaning there are <math>10</math> digits in total. Listing them all out, we have <math>0, 1, 2, 3, 4, 5, 6, 7, 8, 9</math>. Clearly, the most restrictive condition is the consecutive odd digits, so we create casework based on that.
 +
 
 +
Case 1: <math>G</math>, <math>H</math>, <math>I</math>, and <math>J</math> are <math>7</math>, <math>5</math>, <math>3</math>, and <math>1</math> respectively.  
 +
 
 +
A cursory glance allows us to deduce that the smallest possible sum of <math>A + B + C</math> is <math>11</math> when <math>D</math>, <math>E</math>, and <math>F</math> are <math>8</math>, <math>6</math>, and <math>4</math> respectively, so this is out of the question.
 +
 
 +
Case 2: <math>G</math>, <math>H</math>, <math>I</math>, and <math>J</math> are <math>3</math>, <math>5</math>, <math>7</math>, and <math>9</math> respectively.
 +
 
 +
A cursory glance allows us to deduce the answer. Clearly, when <math>D</math>, <math>E</math>, and <math>F</math> are <math>6</math>, <math>4</math>, and <math>2</math> respectively, <math>A + B + C</math> is <math>9</math> when <math>A</math>, <math>B</math>, and <math>C</math> are <math>8</math>, <math>1</math>, and <math>0</math> respectively, giving us a final answer of <math>\boxed{\textbf{(E)}\ 8}</math>
 +
 
 +
== Solution 2==
 +
 
 +
The ten letters must all correspond to ten distinct digits, so every digit is used in the telephone number.
 +
 
 +
We note that <math>1</math>, <math>3</math>, <math>5</math>, <math>7</math>, <math>9</math> are the odd numbers, and possible sequences for <math>GHIJ</math> are either <math>1</math>, <math>3</math>, <math>5</math>, <math>7</math> or <math>3</math>, <math>5</math>, <math>7</math>, <math>9</math>.
 +
 
 +
<math>3</math>, <math>5</math>, and <math>7</math> are included in both possible sequences so that we can rule out the possibilities of <math>5</math> and <math>7</math> for <math>A</math>, so <math>A</math> can only be <math>4</math>, <math>6</math>, or <math>8</math>. Since every possible sequence of DEF also contains <math>4</math>, we can rule out <math>4</math> as well.
 +
 
 +
Testing A=<math>6</math> means <math>D</math>, <math>E</math>, <math>F</math> is <math>0</math>, <math>2</math>, <math>4</math>, respectively. However, <math>6</math> and <math>8</math> must be part of <math>A</math>, <math>B</math>, or <math>C</math>, and they already sum to more than <math>10</math>, so this leaves <math>\boxed{\textbf{(E)}\ 8}</math> as our answer.
 +
 
 +
~megaboy6679
 +
 
 +
==Video Solution by Daily Dose of Math==
 +
 
 +
https://youtu.be/z7o_BiWLDlk?si=9aZ0zIx2lkh_8CV3
 +
 
 +
~Thesmartgreekmathdude
  
 
== See Also ==
 
== See Also ==

Latest revision as of 13:02, 12 October 2024

The following problem is from both the 2001 AMC 12 #6 and 2001 AMC 10 #13, so both problems redirect to this page.

Problem

A telephone number has the form $\text{ABC-DEF-GHIJ}$, where each letter represents a different digit. The digits in each part of the number are in decreasing order; that is, $A > B > C$, $D > E > F$, and $G > H > I > J$. Furthermore, $D$, $E$, and $F$ are consecutive even digits; $G$, $H$, $I$, and $J$ are consecutive odd digits; and $A + B + C = 9$. Find $A$.

$\textbf{(A)}\ 4\qquad \textbf{(B)}\ 5\qquad \textbf{(C)}\ 6\qquad \textbf{(D)}\ 7\qquad \textbf{(E)}\ 8$

Solution

We start by noting that there are $10$ letters, meaning there are $10$ digits in total. Listing them all out, we have $0, 1, 2, 3, 4, 5, 6, 7, 8, 9$. Clearly, the most restrictive condition is the consecutive odd digits, so we create casework based on that.

Case 1: $G$, $H$, $I$, and $J$ are $7$, $5$, $3$, and $1$ respectively.

A cursory glance allows us to deduce that the smallest possible sum of $A + B + C$ is $11$ when $D$, $E$, and $F$ are $8$, $6$, and $4$ respectively, so this is out of the question.

Case 2: $G$, $H$, $I$, and $J$ are $3$, $5$, $7$, and $9$ respectively.

A cursory glance allows us to deduce the answer. Clearly, when $D$, $E$, and $F$ are $6$, $4$, and $2$ respectively, $A + B + C$ is $9$ when $A$, $B$, and $C$ are $8$, $1$, and $0$ respectively, giving us a final answer of $\boxed{\textbf{(E)}\ 8}$

Solution 2

The ten letters must all correspond to ten distinct digits, so every digit is used in the telephone number.

We note that $1$, $3$, $5$, $7$, $9$ are the odd numbers, and possible sequences for $GHIJ$ are either $1$, $3$, $5$, $7$ or $3$, $5$, $7$, $9$.

$3$, $5$, and $7$ are included in both possible sequences so that we can rule out the possibilities of $5$ and $7$ for $A$, so $A$ can only be $4$, $6$, or $8$. Since every possible sequence of DEF also contains $4$, we can rule out $4$ as well.

Testing A=$6$ means $D$, $E$, $F$ is $0$, $2$, $4$, respectively. However, $6$ and $8$ must be part of $A$, $B$, or $C$, and they already sum to more than $10$, so this leaves $\boxed{\textbf{(E)}\ 8}$ as our answer.

~megaboy6679

Video Solution by Daily Dose of Math

https://youtu.be/z7o_BiWLDlk?si=9aZ0zIx2lkh_8CV3

~Thesmartgreekmathdude

See Also

2001 AMC 12 (ProblemsAnswer KeyResources)
Preceded by
Problem 5
Followed by
Problem 7
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 12 Problems and Solutions
2001 AMC 10 (ProblemsAnswer KeyResources)
Preceded by
Problem 12
Followed by
Problem 14
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

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png