201 Mind Boggling Problems In Mathematics

1. Let  $a_{1},a_{2},......,a_{100}$  be real numbers, each less than one, satisfy

(I) Let  $a_{0}$  be the smallest integer  $n$  such that

Show that all the sums 

 are positive.

(II) show that there exists two integers  $p$  and  $q$ ,  $p

are all positive.

Ans:

PART 1: clearly 

 since  $a_{n_0}$  is the smallest integer with  $a_{1}+a_{2}+......+a_{n}>1$  so  $a_{n_0}>1-a_{1}+a_{2}+......+a_{n_0-1}>0$

and  $a_{n_0}+a_{n_0-1}>1-a_1+.....a_{n_0 -2}>0$  etc.this way

all sums 

 are positive.

PART 2 : for convenience i replace  $n_0$  by  $q$

Let us consider the maximum among the sums  $(a_q, a_q+a_{q-1},........,a_q+...a_1)$

[ $a_q<1$  and  $a_q+...+a_1>1$  so  $a_q$  is not the maximum]

Let that maximum sum be  $S= a_q+......a_{q-r}$

now by our assumption  $S>a_q+......a_{q-r+1}$  implying  $a_{q-r}>0$

$S>a_q+.....+a_{q-r+2}$ implying   $a_{q-r}+a_{q-r+1}>0$

this way 

 are all positive.

replacing  $q-r$  by  $p$  we get the result.

2. A troop  $5 meters$  long starts marching. A soldier at the end of the file steps out and  immediately turns around and marches back at the same speed. As soon as he reaches the end of the file, the troop stops marching, and it is found that the troop has moved by exactly  $5 meters.$  What distance has the soldier traveled?

Ans: Let x and y be the speed (measured in meter per second) of the troop and the soldier passing the troop respectively. The time it takes the soldier passing the column is seconds and on the way back to the end of the column he spends seconds. The column has moved 5 meters in seconds while the soldier has marched from the tail to the head and back to the tail of the column. In other words

$5/(y-x) +5/(x+y)=5/x$ or  $ 2xy = y^2-x^2$

or  $(y/x)^2 -2y/x -1=0 $  solving  $y/x= 1+2^{1/2}$

now the soldier had travelled at  $y$  speed for  $5/x$  time.

HENCE distance covered by him  $y*(5/x) = 5y/x= 5(1+ 2^{1/2})$

3. LET  $P$  be an interior point of the trinagle  $ \Delta ABC$ .assume that  $AP,BP,CP$  meet the opposite sides of  $BC,CA,AB$  are  $D,E,F$  respectively show that $$\frac{AF}{FB}+\frac{AE}{EC}=\frac{AP}{PD}$$

Ans: BY Ceva's Theorem

or, 

IN TRIANGLE APE,

IN Tr. ECB

IN Tr. PBD,

Using 3,4,5, in 2

4. INSIDE EQUILATERAL triangla  $ABC$  an arbitrary point  $p$  is taken from which perpendiculars  $PD,PE,PF$  are dropped on  $BC,CA,AB$  respectively. P.T. the ratio

$(PD+PE+PF)/(BD+CE+AF)$ is unique irrespective of P and find its value.

Ans: By Carnot's theorem: 

, where we get  $\boxed{x + y + z = \frac{{3a}}{2}}$

5. $ABC$  is a triangle right angled at  $A$ ,  $D$  be any point on side  $AB$ .  $DE$  drawn parallel to  $BC$  meets  $AC$  at  $E$ .  $F$  is the foot of perpendicular from  $E$  to  $BC$ .

If 

 show that

$(p+q) / t = ( pr + st) / ( rt - ps )$ .

Ans:

6. $AB$  is a chord of circle  $C$

(a) find a point  $P$  on the circumference  $C$  such that  $PA.PB$  is maximum

(b)find a point  $P$  on the circumference  $C$  which maximizes  $PA+PB$ .

Ans: let  $AB$  subtend  $x$  angle in centre of circle, let  $r = radius$

let  $S = PA*PB = (ry)*(rz)$  where  $y$ =angle subtended by  $PA$ ,  $z$ = angle subtended by  $PB$

so  $S= (r^2)(y)(x-y)$

differentiating above w.r.t  $y$  and equating to  $0$  we get  $y= x/2$  second derivative is always negative

so clearly  $P$  is mid point of arc  $AB.$

Second part is similar.

7. THERE ARE  $1000$  doors  $D_1$ , $D_2$ ,....., $D_{1000}$  and  $1000$  people  $P_1$ , $P_2$ , $P_3$ ,...., $P_{1000}$ .Initially all doors were closed.Person  $P_1$  goes in and opens all doors. $P_2$  goes in and opens all  $D_2$ , $D_4$ ,..., $D_{1000}$ ...and so on... $P_m$  goes in and opens  $D_m$ , $D_{2m}$ ,..... $D_{nm}$ ...leaving all other doors untouched.Finally  $P_{1000}$  goes in and opens  $D_{1000}$  if it was closed and closes if it was open.At the end,how many doors remain open?

Ans: no. of doors whose state has changed an odd number of times=no. of positive integers between  $1$  and  $1000$  which have odd number of divisors=no. of perfect squares between  $1$  and  $1000$ = $[\sqrt{1000}]=31$ .Thus, $31$  is the final answer.

[ if  $b$  be a positive integer and its prime factorisation be  $b=({p_1}^{a_1})({p_2}^{a_2})....({p_k}^{a_k})$

where  $p_i$ 's are the prime factors of  $b$  and  $a_i$ 's are their respective powers then number of divisors of  $b$  is  $g=({a_1}+1)({a_2}+1 )...({a_k}+1)$

if  $b$  is square then  $a_i$ 's are even so  $g$  is odd, hence  $b$  has odd number of divisors.

Conversely if  $b$  has odd number of divisors,  $g$  must be odd, so each of  $({a_1}+1),...,({a_k}+1)$  must be odd so each of the  $a_i$ 's should be even. So  $b$  is a square.]

8. SUPPOSE THERE ARE k teams in a round robin tournament,each team plays against all other teams and no game ends in a draw.Suppose that the ith team loses  $l(i)$  games and wins  $w(i)$  games.Show that:-

Ans: Since team i plays  $(k-1)$  games and loses  $l(i)$  games,and there can be no draw,we have  $w(i)=(k-1-l(i))$ ...now we are to prove that $$\sum_{i=1}^k l(i)^2=\sum_{i=1}^k (k-1-l(i))^2$$ Now  $RHS$  becomes  $k((k-1)^2)+LHS-2(k-1)\sum_{i=1}^k l(i)$ ..now in a round robin league,each match is counted as a win and a loss both..so  $\sum_{i=1}^k l(i)$ =total number of matches played= $$\binom{k}{2}$$ = $$k(k-1)/2$$ ...thus cancelling out,we have $$LHS=RHS$$ .

9. SUPPOSE THAT  $P(x)$  is a polynomial of degree  $n$  such that,

$P(k)=\frac{k}{k+1}$ for  $k=0,1,2,3.....,n$

Find the value of $P(n+1)$ .

Ans: Let  $Q(x)=(x+1)P(x)-x$ .

Then the polynomial  $Q(x)$  vanishes for  $k=0,1,2,......,n$  that is,

To find  $a$  we set  $x=-1$  and get,

$1=a(-1)^{n+1}(n+1)!$ thus,

And ,

$=1$ for odd  $n$

$=\frac{n}{n+2}$ for even  $n$ .

10. IF  $n$  is a positive integer greater than  $1$ ,such that  $3n+1$  is a perfect square,then show that  $n+1$  is the sum of three perfect squares.

Ans: Let  $ 3n+1=p^2$  or  $n =(p-1)(p+1)/3$  since  $n$  is integer, either  $3$  divides  $p-1$  or  $p+1$

CASE 1:  $3$  divides  $p-1$  i.e,  $p-1=3r$

then  $n=r(3r+2)$  or 

CASE 2:  $3$  divides  $p+1$ ,  $p+1=3s$

then 

hence proved.

11. SHOW THAT THE NUMBER  $11....1$  with  $3^n$  digits is divisible by