Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

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

(→‎Solution)
(→‎Solution)
Line 15: Line 15:
  
 
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.
 
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.
 
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.
 
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>
 
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>
  

Revision as of 01:49, 28 June 2023

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.

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}$

See Also

2001 AMC 12 (Problems • Answer Key • Resources)
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 (Problems • Answer Key • Resources)
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

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2001_AMC_12_Problems/Problem_6&oldid=194886"