Skip to content

Opening book details…

About this document

IOQM Combinatorics Problems Overview by Gourav Sarma Biswas is a document available to read on EtoBox.

1) The document describes a problem involving finding the number of ways to select a subset of 5 numbers from a set of 25 numbers such that no two numbers share the same unit or tens digit. 2) The question asks for the remainder when this number of ways, N, is divided by 73. 3) The set of numbers is defined as {10a + b: 1 ≤ a ≤ 5, 1 ≤ b ≤ 5} where a and b are integers.

Author
Gourav Sarma Biswas
Language
EN