Saturday, January 20, 2007

"GRE MATH PROBLEM OF THE DAY"

John has 4 ties, 12 shirts, and 3 belts. If each day he wears exactly 1 tie, 1 shirt, and 1 belt, what is the maximum number of days he can go without repeating a particular combination?
(A) 12
(B) 21
(C) 84
(D) 108
(E) 144

5 comments: