<s>[INST] The $1997$ IIT JEE problem 
Let $S$  be a square of unit area. Consider any quadrilateral whose $4$ vertices lie on each side square $S$. Let the length of the sides of this quadrilateral be $a,b,c,d$. Then prove that $$2 \leq a^2+b^2+c^2+d^2 \leq 4$$ 

This problem appeared in IIT JEE $1997$ (re-exam).I really do not know know how to approach this problem properly.I have managed to prove $a^2 + b^2 + c^2 +d^2  \leq 4$
but not the initial inequality.
 [/INST] The smallest $a^2+b^2+c^2+d^2$ is when the quadrilateral has its 4 vertices on the midpoint of each side of square S.  $a=b=c=d=0.5$, and the sum of the squares is $2$.  The largest is simply achieved when the vertices of the quadrilateral lies on the vertices of square S.  ie, both squares are the same.  The sum of the squares of sides is $4$ then.
Now why exactly is this so?  Let the sides of the square be $w, x, y, z$, and let the subscript 1 and 2 denote a section of the side (e.g. $w_1+w_2=w$).  Then $a^2+b^2+c^2+d^2=w_2^2+x_1^2+x_2^2+y_1^2+y_2^2+z_1^2+z_2^2+w_1^2$. The restriction here lies in that $w+x+y+z$ is fixed, the perimeter of S.  We know that $2\times a^2<(a-1)^2+(a+1)^2$, for any $a>=1$.  Hence, since we are trying to achieve the smallest possible result, we would see each side of the square divided exactly in half, such that $w_1=w_2=...=0.5$.
</s>