IMO D
630 = total
let total number of rows = x
every rows contains 3 less than the previous so if first row contains n
=> subsequent rows - (n-3), (n-6), ....
=> total kids = n+ (n-3) + (n-6) +...... (n-3(x-1))
=> 630 = xn - 3*(1+2....+(x-1))
=> 630 = xn - 3*(x(x-1))/2
=> 1260 = x (2n - 3(x-1))
All the options are divisible by 1260
therefore we will need to check the second term (2n - 3(x-1))
case 1 - x = even => 1260(even) = x(even) * (2n - 3(x-1))
=> (2n - 3(x-1)) can be even or odd
but (2n - 3(x-1)) = even - odd = odd=>
x=even and (2n - 3(x-1))=even - not possiblecase 2 - x = odd=> 1260(even) = x(odd) * (2n - 3(x-1))
=> (2n - 3(x-1)) = even
and (2n - 3(x-1)) = even - even = evenSo we mainly need to check the even options B and D
B. x = 4 (even)
1260 = 4 * 315 (315 - odd)
possible
D. x = 6 (even)
1260 = 6 * 210 (210 - even)
not possible----------------------------------------
checking other options
A. x=3 (odd)
1260 = 3 * 420 (420 - even)
possible
C. x = 5 (odd)
1260 = 5 * 252 (252 - even)
possible
E. x=7 (odd)
1260 = 7 * 180 (180-even)
possible