Scribd
Upload
693 views2 pages

Madhava MC Paper 12

1) The document contains 5 math problems in Part I and 5 problems in Part II of the Madhava Mathematics Competition from January 8, 2012. The problems cover a range of calculus, algebra, and geometry topics. 2) Part III contains 4 long-form math problems involving maximizing the area of shapes inscribed in a triangle, properties of continuous functions, determining conditions for expressions to be integers, and properties of matrix equations and set operations. 3) The document provides a sample of the type of high-school and undergraduate level math problems included in the Madhava Mathematics Competition, testing concepts across multiple domains of mathematics.

Uploaded by

Aman-Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
693 views2 pages

Madhava MC Paper 12

1) The document contains 5 math problems in Part I and 5 problems in Part II of the Madhava Mathematics Competition from January 8, 2012. The problems cover a range of calculus, algebra, and geometry topics. 2) Part III contains 4 long-form math problems involving maximizing the area of shapes inscribed in a triangle, properties of continuous functions, determining conditions for expressions to be integers, and properties of matrix equations and set operations. 3) The document provides a sample of the type of high-school and undergraduate level math problems included in the Madhava Mathematics Competition, testing concepts across multiple domains of mathematics.

Uploaded by

Aman-Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MADHAVA MATHEMATICS COMPETITION, 8 January 2012

Part I
N.B. Each question in Part I carries 2 marks.
Rk
1. Let n be a fixed positive integer. The value of k for which 1 xn1 dx = n1 is
2 1 1
(a) 0 (b) 2n (c) ( ) n (d) 2 n
n
2. Let S = {a, b, c}, T = {1, 2}. If m denotes the number of one-one functions and
n denotes the number of onto functions from S to T, then the values of m and n
respectively are
(a) 6,0 (b) 0,6 (c) 5,6 (d) 0,8.
1
3. In the binary system, can be written as
2
(a) 0.01111 (b) 0.01000 (c) 0.0101 (d) None of these

4. For the equation |x|2 + |x| 6 = 0


(a) there is only one root. (b) the sum of the roots is -1.
(c) the sum of the roots is 0. (d) the product of the roots is -6.
1 1! + 2 2! + + n n!
5. The value of lim
n (n + 1)!
1
(a) 1 (b) 2 (c) (d) does not exist.
2
6. Let f : R R and g : R R be differentiable functions such that f 0 (x) > g 0 (x) for
every x. Then the graphs y = f (x) and y = g(x)
(a) intersect exactly once. (b) intersect at most once.
(c) do not intersect. (d) could intersect more than once.

7. The function |x|3 is


(a) differentiable twice but not thrice at 0. (b) not differentiable at 0.
(c) three times differentiable at 0. (d) differentiable only once at 0.

8. Let A be the n n matrix (n 2), whose (i, j)th entry is i + j for all i, j = 1, 2, , n.
The rank of A is
(a) 2 (b) 1 (c) n (d) n 1.

9. Let A = 1 + 0i be the point in the complex plane. Let P QR be an arc with centre at

A and radius 2. If P = 1 + 2 + 2i, Q = 1 + 0i and R = 1 + 2 2i

then the shaded region is given by


(a) |z + 1| < 2, | arg(z + 1)| < 2
(b) |z 1| < 2, | arg(z 1)| < 2
(c) |z + 1| > 2, | arg(z + 1)| < 4
(d) |z 1| > 2, | arg(z + 1)| < 4

dy
10. The solution of = ax+y is
dx
(a) ax ay = c (b) ax + ay = c (c) ax ay = c (d) ax + ay = c
Part II
N.B. Each question in Part II carries 5 marks.

1. Let f : [0, 4] [3, 9] be a continuous function. Show that there exists x0 such that
3x0 + 6
f (x0 ) = .
2
2. Suppose a, b, c are all real numbers such that a + b + c > 0, abc > 0 and ab + bc + ac > 0.
Show that a, b, c are all positive.

3. Let f be a continuous function on [0, 2] and twice differentiable on (0, 2). If f (0) =
0, f (1) = 1 and f (2) = 2, then show that there exists x0 such that f 00 (x0 ) = 0.

4. Integers 1, 2, , n are placed in such a way that each value is either bigger than all
preceding values or smaller than all preceding values. In how many ways this can be
done? (For example in case of n = 5, 3 2 4 1 5 is valid and 3 2 5 1 4 is not valid.)

Part III
N.B. Each question in Part III carries 12 marks.

1. Consider an isosceles right triangle with legs of fixed length a.


Inscribe a rectangle and a circle inside the triangle as indicated
in the figure. Find the dimensions of the rectangle and the
radius of the circle which make the total area of the rectangle
and circle maximum.

2. Assume that f : R R is a continuous, one-one function. If there exists a positive


integer n such that f n (x) = x, for every x R, then prove that either f (x) = x or
f 2 (x) = x. (Note that f n (x) = f (f n1 (x)).)
x3 x2 x
3. Consider f (x) = + + + 1. Prove that f (x) is an integer whenever x is an
6 2 3
integer. Determine with justification, conditions on real numbers a, b, c and d so that
ax3 + bx2 + cx + d is an integer for all integers x.

2 1 0 x f
4. Suppose A = 1 b d , X = y , U = g . Find

1 b d+1 z h
conditions on A and U such that the system AX = U has no solution.

5. Let A and B be finite subsets of the set of integers. Show that


|A + B| |A| + |B| 1. When does equality hold?
(Here A + B = {x + y : x A, y B}. Also, |S| denotes the number of elements in the
set S.)

You might also like