Scribd Logo
Upload

Welcome to Scribd!

  • 2018 (E.S.) Combinatorics

    Uploaded by

    publicacc71
    10 views1 page

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    10 views1 page

    2018 (E.S.) Combinatorics

    Uploaded by

    publicacc71

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    of 1
    Indian Institute of Technology Patna Department of Mathematics Combinatories (MA522) End-semester Exam (2017-2018) Full Marks: 80 ‘Time Limit: 3 Hrs Answer any 8 questions. If you answer more than 8, only first 8 answers will be evaluated. 1. What is Vandermonde's identity? Prove Vandermonde’s identity by combinatorial arguments. Prove the following identity by combinatorial arguments: [2+4+4) ()-G)+@)-@+-er@)- 2. Prove or disprove that every sequence of 10 distinct real numbers contains a subsequence of C 4 numbers that is either strictly increasing or strictly decreasing Give an example of a sequence of 9 distinct zeal numbers in which every subsequence that is strictly increasing or strictly decreasing is of length at most 3. +5) 3. Define Euler’s phi function. Derive the expression for Euler’s phi function, (7) (2+8) 4, How many symmetric relations are possible on a set of n elements? How many antisymmetric relations are possible on a set of n elements? Let R = {(a,b), (a,d), (b,d),(c,a),(c,e), (dye). (65d), (e,a)} be a relation on {a,b, c,d, ¢} Find the transitive closure of R. (24345) 5. Define derangement of n integers. Show that the derangement of n integers, Dn is equal to (n= 1)[Dn-1+ Dn-2} +s] 6. Define Turn number for integers n,k and 1. Show that Turin number T(n, k, 1) is greater than or equal to re 19] 7. How many one-one functions are there from a set of n elements to a set of m elements? e How many onto functions are there from a set of n elements to a set of m elements? [4+ 6] 8. Show that the number of ways to parenthesize the product of n +1 integers is equal to the number of increasing paths from (0,0) to (n,n) that stays on or above the diagonal. [10] 9. Let Pk(n) be the mumber of partitions of an integer n into exactly k parts. Show that i Pi(n) = 3 Pal —k). Prove the following inequality: +7] bai fre Mg Ba < 1 al 3)

    You might also like