n is selected from the set {1,2,3,....100} and the number 2n+3n+5n is formed. Total number of ways of selecting n so that the formed number is divisible by 4 is equal to
A
50
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
49
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
C
48
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
None of these
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution
The correct option is A49 On dividing 2n by 4 we get 2 as reminder when n=1 and 0 of rest value of n
On dividing 3n by 4 we get 3 as reminder when n is odd and 1 as reminder when n is even.
On dividing 5n by 4 we get 1 as reminder for all value of n.
2n+3n+5n is divisible by 4 only when
reminder on dividing 2n by 4+reminder on dividing 3n by 4+ reminder on dividing 5n by 4= a multiple of 4
This is possible for all odd n except 1 because for all odd n sum of reminders =0+3+1=4
For n=1 we have sum of reminder =2+3+1=6
So our answer will be all odd number except 1 which is equal to 49