MathDB
Easy counting

Source: PRMO 2019 Leg 2 P12

August 25, 2019
combinatoricscountingEnumerationEnumerative CombinatoricsPRMO

Problem Statement

Let NN be the number of ways of choosing a subset of 55 distinct numbers from the set 10a+b:1a5,1b5{10a+b:1\leq a\leq 5, 1\leq b\leq 5} where a,ba,b 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 NN is divided by 7373?