Question 1 |

Let U = {1, 2,...,n}, where n is a large positive integer greater than 1000. Let
k be a positive integer less than n. Let A, B be subsets of U with |A| = |B| = k
and A\cap B=\phi . We say that a permutation of U separates A from B if one of the
following is true.

- All members of A appear in the permutation before any of the members of B.

- All members of B appear in the permutation before any of the members of A.

How many permutations of U separate A from B?

- All members of A appear in the permutation before any of the members of B.

- All members of B appear in the permutation before any of the members of A.

How many permutations of U separate A from B?

n! | |

\binom{n}{2k} (n-2k)! | |

\binom{n}{2k} (n-2k)! (k!)^2 | |

2 \binom{n}{2k} (n-2k)! (k!)^2 |

Question 1 Explanation:

Question 2 |

There are 6 jobs with distinct difficulty levels, and 3 computers with distinct processing speeds. Each job is assigned to a computer such that:

The fastest computer gets the toughest job and the slowest computer gets the easiest job.

Every computer gets at least one job.

The number of ways in which this can be done is ___________.

The fastest computer gets the toughest job and the slowest computer gets the easiest job.

Every computer gets at least one job.

The number of ways in which this can be done is ___________.

18 | |

36 | |

65 | |

27 |

Question 2 Explanation:

Question 3 |

The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L's are indistinguishable, is ______.

120 | |

24 | |

36 | |

12 |

Question 3 Explanation:

Question 4 |

The number of integers between 1 and 500 (both inclusive) that are divisible by 3 or 5 or 7 is
______________.

135 | |

350 | |

271 | |

335 |

Question 4 Explanation:

Question 5 |

The number of 4 digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set {1, 2, 3} is____________.

10 | |

15 | |

18 | |

12 |

Question 5 Explanation:

There are 5 questions to complete.