What is the formula for the number of permutations of n objects taken r at a time? | Card: 1 / 24 |
True or False: The number of circular permutations of n different objects is (n-1)!. | Card: 3 / 24 |
Riddle: I can arrange n objects in a straight line, but when arranged in a circle, my count decreases. What am I? | Card: 5 / 24 |
The number of permutations of n different objects taken r at a time when p particular objects do not occur is represented as ______. | Card: 7 / 24 |
Which of the following represents combinations of n objects taken r at a time? A) P(n, r) B) C(n, r) C) n! D) nPr | Card: 9 / 24 |
True or False: The pigeonhole principle states that if n + 1 objects are put into n boxes, at least one box must contain exactly one object. | Card: 11 / 24 |
![]() Unlock all Flashcards with EduRev Infinity Plan Starting from @ ₹99 only |
What is the generating function for the constant sequence where every term is equal to 1? | Card: 13 / 24 |
For a linear recurrence relation of the form Fn = AFn−1 + BFn−2, what is the characteristic equation? | Card: 17 / 24 |
Riddle: I'm a method used to solve recurrence relations and can represent sequences as coefficients of powers. What am I? | Card: 19 / 24 |
True or False: The number of ways to fill r places with n elements when repetition is allowed is n^r. | Card: 21 / 24 |
What is the formula for the number of permutations of n objects taken r at a time? | Card: 23 / 24 |






