How 9 Cheenta students ranked in top 100 in ISI and CMI Entrances?
Learn More

ISI B.Stat, B.Math Paper 2014 Subjective| Problems & Solution

Here, you will find all the questions of ISI Entrance Paper 2014 from Indian Statistical Institute's B.Stat Entrance. You will also get the solutions soon of all the previous year problems.

Problem 1:

In a class there are $100$ student. We define $\mathbf { A_i} $ as the number of friends of $\mathbf { i^{th} }$ student and $\mathbf { C_i }$ as the number of students who has at least i friends. Prove that $\mathbf { \sum_1^{100} A_i = \sum_0^{99} C_i }$

Problem 2:

$PQR$ be a triangle. Take a point $A$ on or inside the triangle. Let $f(x, y) = ax + by + c$. Show that $\mathbf { f(A) \le max \{ f(P), f(Q) , f(R)\} }$

Problem 3:

Let $ \mathbf { y = x^4 + ax^3 + bx^2 + cx +d}$ (where $a,b,c,d,\in \mathbb{R})$. it is given that the functions cuts the $x$ axis at least $3$ distinct points. Then show that it either cuts the $x$ axis at $4$ distinct point or $3$ distinct point and at any one of these three points we have a maxima or minima.

Problem 4:

Let $f(x)$ and $g(x)$ be twice differentiable non decreasing functions defined on an interval $(a,b)$ such that for each $x \in (a,b)$, $f''(x) = g(x)$ and $g''(x) = f(x)$ and also that $f(x) . g(x)$ is a linear in $x$ on $(a,b)$ . Then show that $f(x) = g(x) = 0$.

Problem 5:

Prove that sum of any $12$ consecutive integers cannot be perfect square. Give an example where sum of $11$ consecutive integers is a perfect square.

Problem 6:

$\mathbf { A = \{(x, y) : x = u + v , y = v , u^2 + v^2 \le 1\} } $ . Then what is the maximum length of a line segment enclosed in this area.

Problem 7:

Let $f(x)$ be a non decreasing function defined on the domain $\mathbf {[0, \infty) }$ . Then show that if $\mathbf { 0\le x < y < z < \infty , (z-x) \int_y^z f(u) du \ge (z-y) \int_x^z f(u) du }$

Problem 8:

$n (> 1)$ lotus leaf's are arranged in a circle. A frog jumps from a particular leaf by the following rule: It always moves clockwise. From staring point it skips $1$ leaf and jumps to the next. Then it skips $2$ leaves and jumps to the following. That is in the $3rd$ jump it skips $3$ leaves and $4th$ jump it skips $4$ leaves and so on. In this manner it keeps moving round and round the circle of leaves. It may go to one leaf more than once. If it reaches each leaf at least once then n (the number of leaves) cannot be odd.

Some useful Links:

Knowledge Partner

Cheenta is a knowledge partner of Aditya Birla Education Academy

Cheenta Academy

Aditya Birla Education Academy

Aditya Birla Education Academy

Cheenta. Passion for Mathematics

Advanced Mathematical Science. Taught by olympians, researchers and true masters of the subject.