How many permutations of the letters ABCDEFGHIJKLM do not
contain the strings “BAD” or “DIG” or “CLAM” consecutively? (Hint:
Inclusion-exclusion and subtraction).
**I KNOW THE ANSWER IS NOT 13! - 11! - 11! - 10! ** - please do
not give that as one.
Letters are pushed on a stack in order: R A N D O M O P S.
Specify where to insert pop operations (shown by ‘*’) among the
pushes of the given letters, in order to produce the output:
ADONOMSPR . You can only do this process once. That is, you cannot
take the output produced and then pass it again through the
stack.
*PERMUTATIONS*
How many tablets of 3 letters and 3 numbers can we form with the
letters {A, B, C, D, E} and the 10 digits if the tablet should
have:
◦ Letters and numbers should be kept together without
repetition?
◦ Letters and numbers should be kept together with
repetition?
◦ Letters and numbers do not have to be kept together without
repetition?
◦ Letters and numbers do not have to be kept together with
repetition?
1. a. How many permutations are there of the letters
{A,B,C,D,E,F}? Of there, how many are even?
b. Express the permutation BAFEDC in P6 in cycle
notation and determine whether it is even or odd.
c. Determine the composition BAFEDC*BCAFDE in P6. Is
the composition even or odd?
d. What is the members of P6 whose cycle notation
(1345)(26)?
consider “COLLEGEOFENGINEERING”
a) How many permutations are there total?
b) How many permutations start and end with vowels?
c) How many permutations do NOT have consecutive vowels in
them?
d) How many permutations contain the vowels in order (all Es
before All Is before all Os)?
e) How many permutations contain the substring "GINGER"?
give a constructive proof of fn = Q^n + P^n/ Q - P ,
where Q is the positive root
and P is negative root of x^2 - x - 1= 0
fn is nth term of fibonacci sequence, f1 = 1 f2, f3 = f2 +f1,
... fn= fn_1 +fn_2 , n>2