Let f be an bijective function (one-one and onto) from the set to n itself. Show that there is a positive integer such that for each .
Note: denotes the composite function repeated M times.
Show that there exists a convex hexagon in the plane such that : (a) all its interior angles are equal (b) its sides are 1,2, 3, 4, 5, 6 in some order.
There are ten objects with total weight 20, each of the weights being a positive integer. Given that none of the weights exceed 10, prove that the ten objects can be divided into two groups that balance each other when placed on the two pans of a balance.
At each of the eight corners of a cube, write +1 or -1 arbitrarily. Then, on each of the six faces of the cube write the product of the numbers written at the four corners of that face. Add all the fourteen numbers so written down. Is it possible to arrange the numbers +1 and -1 at the corners initially so that the final sum is zero?
Given the seven element set , find a collection T of 3-element subsets of A such that each pair of elements from A occurs exactly in one of the subsets of T.
Solutions will be put up tomorrow. Meanwhile, make a whole-hearted attempt to crack these!
PS: In case you want more, information, please visit:
PS: I am not in any official way connected to the above official conductors of the exam.