Discrete Mathematics - Counting, Mathematical Induction and Discrete Probability

Avatto > > UGC NET COMPUTER SCIENCE > > PRACTICE QUESTIONS > > Discrete Mathematics > > Counting, Mathematical Induction and Discrete Probability

16. Let P (n) : 2n < n!, for all n ≥ 4. Then P (6) is

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


17. For all n ∈ N, 4n − 1 is always divisible by

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


18. Let A = {1, 2, 3, ..., k}. What should be the minimum value of k such that always there are at least 2 numbers having same remainder when divided by 5?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *