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) : 2ⁿ < n!, for all n ≥ 4. Then P (6) is

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

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

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

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?

Answer
Comment
Array

Option : C
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

Related Quiz.
Counting, Mathematical Induction and Discrete Probability

Forgot your password?

I agree with the Terms.