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

Total number of ways of selecting two numbers from the set {1,2,3,.....,90} so that their sum is divisible by 3, is

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

The correct option is B 1335
No of multiples of 3 in {1,2,3,...90}=30
No of numbers which give '1' remainder in {1,2...90}=30
No of number which give '2; remainder in {1,2...90}=30
case : selecting '2' numbers which are divisible by 3
30c2=30×292=435
case: selecting '2' number where are gives
remainder '1' other remainder 2
30c1×30c1=900
Total ways (pairs) =900+435=1335

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Passage 22
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon