jaypshah
Nice problem, took me while to figure out even how to begin. I really doubt one would come across such a question on the actual GMAT.
I would go with E which I arrived by trial and error. This the the way I approached it. The aim is to find the smallest LCM of ten numbers as the numbers keep on increasing.
By this method I got the number of rows as 48. I could have missed a lower LCM but unlikely. Hence squares = approx 50^ 2 = 2500
OA?
You are right in that if there is a number k that is a factor of more than 10 numbers less than or equal to m, then we cannot build a Tara square with m rows. What is the smallest number that has more than 10 factors?
Remember that the best way to count factors of a number is to look at its prime factorization. A number with 11 factors will look like p^10, and a number with 12 factors will look like p^11 or p^3*q^2 where p and q are distinct prime numbers
if p=2, p^10 is more than 1000
But if p=2 and q=3, p^3*q^2=72 (switching q and p would yield a higher number)
72 has twelve factors and thus a Tara square cannot have 72 rows.
But every integer less than 72 has at most 10 factors, so 71 is the largest possible number of rows of a Tara square, yielding 71^2 squares approx 5000