Scribd Logo
Upload

Welcome to Scribd!

  • 2 views

    Combi CT

    Uploaded by

    dwaipayanmanna10
    Math Notes

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Combi CT

    Uploaded by

    dwaipayanmanna10
    2 views2 pages
    Math Notes

    Original Title

    combi_ct

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Math Notes

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    2 views2 pages

    Combi CT

    Uploaded by

    dwaipayanmanna10
    Math Notes

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    Class Test on Combinatorics

    Ramanujan School Of Mathematics


    Instructor: Samprit Chakraborty
    Time: 2 hours
    Each question carries 10 marks.

    1. There are four basket-ball players A, B, C, D. Initially, the ball is with A. The ball is al-
    ways passed from one person to a different person. In how many ways can the ball come
    back to A after seven passes? (For example A → C → B → D → A → B → C → A and
    A → D → A → D → C → A → B → A are two ways in which the ball can come back to A
    after seven passes.)

    2. From a set of 11 square integers, show that one can choose 6 numbers a2 , b2 , c2 , d2 , e2 , f 2 such
    that
    a2 + b2 + c2 ≡ d2 + e2 + f 2 (mod12)
    .

    3. Let N denote the set of all natural numbers. Define a function T : N → N by T (2k) = k and
    T (2k + 1) = 2k + 2. We write T 2 (n) = T (T (n)) and in general T k (n) = T k−1 (T (n)) for any
    k > 1 (i) Show that for each n ∈ N, there
     exists k such that T k (n) = 1. (ii) For k ∈ N, let ck de-
    note the number of elements in the set n : T k (n) = 1 . Prove that ck+2 = ck+1 +ck , for k ≥ 1.

    4. Suppose 2016 points of the circumference of a circle are coloured red and the remaining points
    are coloured blue. Given any natural number n ≥ 3, prove that there is a regular n-sided
    polygon all of whose vertices are blue.

    5. Let n ≥ 1 be an integer and consider the sum


    X n  
    n
     
    n
     
    n
    
    n−2k k n n−2
    x= 2 3 = 2 + 2 ·3+ 2n−4 · 32 + · · ·
    2k 0 2 4
    k≥0

    1
    Show that 2x−1, 2x, 2x+1 form the sides of a triangle whose area and inradius are also integers.

    All the best!

    You might also like