Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

prealgebra senior

Problem

An ordinary -sided die has a number on each face from to (each number appears on one face). How many ways can I paint two faces of a die blue, so that the product of the numbers on the painted faces isn't equal to ?
Solution
First, let's ignore the requirement that the product can't be . Then I can pick the first blue face in ways, and the second blue face in ways, making choices in all. But we've actually counted each possible result twice, because it makes no difference which of the two blue faces I chose first and which I chose second. So the number of different pairs of faces is really , or .

Now we exclude the pairs which have a product of . There are two such pairs: and . That leaves me pairs of faces I can paint blue.
Final answer
13