Step 1: Let the number of pots sold be \(n\). Then the price per pot is also \(n\) (\(₹ n\) each), so the total money is \(n^2\). Suppose they buy \(k\) packets of potato chips at \(₹ 10\) each and one packet of banana chips at \(₹ b\) with \(b<10\). Then \[ n^2 \;=\; 10k + b. \]
Step 2: The total number of packets is \(k+1\), which is split equally between the two brothers. Hence \(k\) must be odd so that \(k+1\) is even. Thus \(\frac{n^2 - b}{10}=k\) is odd, giving \[ n^2 - b \equiv 10 \pmod{20}. \] Squares modulo \(20\) are \(\{0,1,4,5,9,16\}\). Therefore \(b \equiv n^2 - 10 \pmod{20}\) forces \(b\) to be the only value \(<10\) that fits, namely \[ b=6. \] (Indeed, \(16-10\equiv 6 \pmod{20}\) works, and no other square class yields a number \(<10\).)
Step 3: One brother gets the banana packet plus \(\frac{k-1}{2}\) potato packets; the other gets \(\frac{k+1}{2}\) potato packets. Their values are \[ V_1 = b + 10\cdot\frac{k-1}{2}, \qquad V_2 = 10\cdot\frac{k+1}{2}. \] Hence the difference is \[ V_2 - V_1 = 10 - b = 10 - 6 = 4. \] To make the division equitable, the richer brother gives half of this difference, \[ \frac{4}{2} = 2. \] \[\boxed{2}\]
| \(3x+4y\) | \(2x\) | \(2x+y+z\) |
| \(2x^2\) | \(4y\) | \(y^2+z\) |
| \(y+z\) | \(3x+2z\) | \(z-1\) |
From a group of 545 contenders, a party has to select a leader. Even after holding a series of meetings, the politicians and the general body failed to reach a consensus. It was then proposed that all 545 contenders be given a number from 1 to 545. Then they will be asked to stand on a podium in a circular arrangement, and counting would start from the contender numbered 1. The counting would be done in a clockwise fashion. The rule is that every alternate contender would be asked to step down as the counting continued, with the circle getting smaller and smaller, till only one person remains standing. Therefore the rst person to be eliminated would be the contender numbered 2.