wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Let N=3n+8n+10n. The total number of ways of choosing n from the set {1,2,3,....,201}, such that N is divisible by 9 is

A
99
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
100
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
C
101
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
102
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution

The correct option is B 100
We know that:
a) Any power of 3 more than 1 is divisible by 9
b) 8n+10n is divisible by 9 when n is odd.
So, we can select any odd number more than 1 for n.
This can be done in 201+121=1011=100 ways.
Hence, (B) is correct.

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Solving QE by Factorisation
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon