Question 1198805
<br>
Each of n students sends (n-1) cards; the total number of cards is n(n-1).  The equation for solving the problem using formal algebra is then<br>
{{{n(n-1)=992}}}<br>
If you solve that using formal algebra, then<br>
{{{n^2-n=992}}}
{{{n^2-n-992=0}}}<br>
To solve that by the formal mathematical method of factoring, you need to find two whole numbers whose difference is 1 and whose product is 992.<br>
But that is exactly what the original equation tells you to do -- so the formal algebra gets you no closer to the solution than you were at the start.<br>
So if formal algebra is not required, use logical reasoning, a bit of estimation, and common sense to find the answer.<br>
One way to do that is to reason that n(n-1) is very close to n(n) = n^2; so solve n^2=992 to get an estimate of the answer.<br>
sqrt(992) = 31.496 to 3 decimal places, so n and (n-1) have to be 32 and 31; that means the number of students in the class is n=32.<br>
Another way to get the answer using logical reasoning is to see that 30*30 = 900 and 40*40 = 1600.  Since 992 is much closer to 900 than 1600, the numbers n and n-1 have to be consecutive whole numbers between 30 and 40 and much closer to 30; and the units digit of the product of the two whole numbers is 2.  That makes 31 and 32 the clear choices, so the number of students in the class is 32.<br>