State sum rule and product rule. If 26 integers are chosen from the se | Discrete Structures 2081

2081 6

Discrete Structures20815 marksPigeonhole Principle

State sum rule and product rule. If 26 integers are chosen from the set of consecutive integers {1,2,3,...,50}, prove that there are sure to be two numbers so that one is multiple of the other. [5]

Sum Rule: If a task can be done in one of $n1$ ways or one of $n2$ ways, where none of the set of $n1$ ways is the same as any of the set of $n2$ ways, then there are $n1 + n2$ ways to do the task. Product Rule: If a task can be broken down into a sequence of two subtasks, and there are $n1$ ways...

← PreviousAll questions Next question →

Up nextDiscuss about meet and join operation between Boolean matrices. What are the values of 5 m

Sum Rule: If a task can be done in one of $n1$ ways or one of $n2$ ways, where none of the set of $n1$ ways is the same as any of the set of $n2$ ways, then there are $n1 + n2$ ways to do the task. Product Rule: If a task can be broken down into a sequence of two subtasks, and there are $n1$ ways...