Question bank/JEE Main/Mathematics

JEE MainMathematicsToughPermutations and Combinations

n is selected from the set [IMAGE] and the number
[IMAGE] is formed. Total number of ways of selecting n so

that the formed number is divisible by 4 is equal to


Show answer and solution
If n odd. [IMAGE] is divisible by 4 if n > 2 Thus,
[IMAGE] i.e., n can take 49 different values. If n is

even, [IMAGE] is not divisible

by 4 as [IMAGE] will be in the form of

[IMAGE] Thus, the total number of ways of selecting

is equal to







Source: Grass-G / M-10 Mathematics Paper-1 30 Oct.docx

Need a video for this idea?

Scan any doubt from your notes and get a whiteboard explanation.