I employed logic to start:
A --> eliminate b/c it's even and 2 will not have a remainder. It's also a multiple of 5, so it won't have a remainder either.
Don't need to test 5 because each B, C, D, E will have a remainder of 1. Employing general number sense, we know that 21, 42, 63, 84 are divisible by 3 and so their multiple (each *10) are divisible by 3, so B, C, D, and E will each have a remainder 1 when divided by 3.
I'm not as strong with the number properties of 7, so I'm going to test 9.
Numbers are divisible by 9 when the digits add up to 9. So to have a remainder of 1, the digits need to add up to 8 or 10.
B--> eliminate. Sum of digits is 4 (2+1+1), which is not 8 or 10 so won't have a remainder of 1 when divided by 9 (remainder will be 4 - don't need to calculate while doing the problem!)
C--> eliminate. Sum of digits is 7 (4+2+1), which is not 8 or 10 so won't have remainder 1 when divided by 9 (remainder will be 7).
E--> eliminate. Sum of digits is 13 (8+4+1), not 8 or 10 so won't have remainder of 1 when divided by 9 (remainder will be 4).
That leaves D. To make sure 7 has a remainder 1, we can implore # sense. 63 is a multiple of 7, therefore 630 is (63*10) and 631 will have a remainder 1.