Easy counting
Source: PRMO 2019 Leg 2 P12
August 25, 2019
combinatoricscountingEnumerationEnumerative CombinatoricsPRMO
Problem Statement
Let be the number of ways of choosing a subset of distinct numbers from the set
where are integers, such that no two of the selected numbers have the same units digits and no two have the same tens digit. What is the remainder when is divided by ?