We know that 10 divided by 9 leaves remainder 1
=> \(10^p\) divided by 9 leaves remainder 1 as well
(Any positive integer power of 10, if is divided by 9, the remainder is 1)
=> \(7 * 10^p\) divided by 9 leaves remainder 7 * 1 = 7
Since \(7 * 10^p + 4p\) is divisible by 9, we have:
The remainder when \(7 * 10^p + 4p\) is divided by 9, the remainder is 0
=> The remainder when 4p is divided by 9 must be 2
(Since \(7 * 10^p\) has remainder 7; and 2+7= 9, i.e. remainder is 0)
At p = 5, i.e. 4p = 20, the required remainder becomes 2.
Answer B
Posted from my mobile device
_________________
Sujoy Kr Datta | GMAT classic 750 (Q51) | CAT 99.99 | Mentor & Coach | IIT Kgp alum
Personalized Tutoring: one-on-one / in-group |
Recorded Course hosted on Topmate1. Recorded GMAT course with 8 month access & support (DM for access)2. Live sessions for GMAT & GRE
40 hrs of live classes | 2000+ questions | 15 Mocks | Doubt clearing | Mock analysis Email: sujoy.datta@gmail | WhatsApp: +919433063089