Printable

2008 AMC 10A Problem 23

Include the solution Back to the problem

2008 AMC 10A Problem 23AMC 10 Step by Step

Name: Date: September 13, 2026

Basic Counting · difficulty 4 of 5 · about 4 min · position P21-25

Two subsets of the set $S=\lbrace a,b,c,d,e\rbrace$ are to be chosen so that their union is $S$ and their intersection contains exactly two elements. In how many ways can this be done, assuming that the order in which the subsets are chosen does not matter?

A)
$20$
B)
$40$
C)
$60$
D)
$160$
E)
$320$

2008 AMC 10A Problem 23

Working