Elitmus
Exam
Numerical Ability
Algebra
if n is between 2 to 50,such that n is divisble by (n-2) ! (factorial). Find the total no. of such numbers.
Read Solution (Total 4)
-
- N is completely divisible by n-2! Then we have to check only n>=n-2! values of n.they are n=2,3,4.
- 7 years agoHelpfull: Yes(17) No(0)
- N is completely divisible by n-2! Then we have to check only n>=n-2! values of n. But n is between 2 to 50....it means that 2
- 7 years agoHelpfull: Yes(9) No(2)
- if we include 2 and 50 then there would be 48-13=35
explanation: 2 and 3 will be divisible by 0 and 1 factorial .
from 4 to 50 all prime no. will not be divisible by (n-2)! and they are like 5,7,11,13,17,19,23,29,31,37,41,43,47 so they are 13 .
hence answer is 48-13=35. - 7 years agoHelpfull: Yes(5) No(13)
- n is between 2 to 50 i.e number must be 3 to 49 . total = 47 number
let n=3 , 4 ,5 ,6 & 7
n=3 , (3-2)!/3 1/3 is not divisible
n=4 , (4-2)!/4 2*1/4 is not divisible
n=5 , (5-2)!/5 3*2/5 is not divisible
n=6, (6-2)!/6 4*3*2/6 is divisible
n=7, (7-2)!/7 5*4*3*2/7 is not divisible
after 7 we can see all prime number are not divisible
so number are 3,4,5,7,11,13,17,19,23,29,31,37,41,43,47 total 15
so answer would be 47-15=32 - 7 years agoHelpfull: Yes(1) No(7)
Elitmus Other Question