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 "2013 AMC 10A Problems/Problem 7"

(→‎Solution 2)
(→‎Solution 2)
Line 24: Line 24:
 
==Solution 2==
 
==Solution 2==
  
−
We can use complementary counting. Since there must be an English class, we will add that to our list of classes for <math>3</math> remaining spots for the classes. We are also told that there needs to be at least one math class. This calls for complementary counting. The total number of ways of choosing <math>3</math> classes out of the <math>5</math> is <math>\binom{5}3</math>. The total number of ways of choosing only non-mathematical classes is <math>\binom{3}3</math>. Therefore the amount of ways you can pick classes with at least one math class is <math>\binom{5}3-\binom{3}3=10-1=\boxed{9}</math> ways, or <math>(C)</math>.
+
We can use complementary counting. Since there must be an English class, we will add that to our list of classes for <math>3</math> remaining spots for the classes. We are also told that there needs to be at least one math class. This calls for complementary counting. The total number of ways of choosing <math>3</math> classes out of the <math>5</math> is <math>\binom{5}3</math>. The total number of ways of choosing only non-mathematical classes is <math>\binom{3}3</math>. Therefore the amount of ways you can pick classes with at least one math class is <math>\binom{5}3-\binom{3}3=10-1=\boxed{9}</math> ways, or <math>\textbf{(C)}</math>.
  
 
==See Also==
 
==See Also==
  
 
{{AMC10 box|year=2013|ab=A|num-b=6|num-a=8}}
 
{{AMC10 box|year=2013|ab=A|num-b=6|num-a=8}}

Revision as of 01:11, 8 February 2013

Problem

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$

Solution 1

Let us split this up into two cases.

Case $1$: The student chooses both algebra and geometry.

This means that $3$ courses have already been chosen. We have $3$ more options for the last course, so there are $3$ possibilities here.

Case $2$: The student chooses one or the other.

Here, we simply count how many ways we can do one, multiply by $2$, and then add to the previous.

WLOG assume the mathematics course is algebra. This means that we can choose $2$ of History, Art, and Latin, which is simply $\dbinom{3}{2} = 3$. If it is geometry, we have another $3$ options, so we have a total of $6$ options if only one mathematics course is chosen.

Thus, overall, we can choose a program in $6 + 3 = 9$ ways, $\textbf{(C)}$

Solution 2

We can use complementary counting. Since there must be an English class, we will add that to our list of classes for $3$ remaining spots for the classes. We are also told that there needs to be at least one math class. This calls for complementary counting. The total number of ways of choosing $3$ classes out of the $5$ is $\binom{5}3$. The total number of ways of choosing only non-mathematical classes is $\binom{3}3$. Therefore the amount of ways you can pick classes with at least one math class is $\binom{5}3-\binom{3}3=10-1=\boxed{9}$ ways, or $\textbf{(C)}$.

See Also

2013 AMC 10A (Problems • Answer Key • Resources)
Preceded by
Problem 6 		Followed by
Problem 8
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
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2013_AMC_10A_Problems/Problem_7&oldid=50934"