edited by
12,981 views

4 Answers

Best answer
40 votes
40 votes
Answer - $0.26$

Number of integers divisible by $2 = 50$

Number of integers divisible by $3 = 33$

Number of integers divisible by $5 = 20$

Number of integers divisible by $2$ and $3 = 16$

Number of integers divisible by $2$ and $5 = 10$

Number of integers divisible by $3$ and $5 = 6$

Number of integers divisible by $2$ and $3$ and $5 = 3$

Total numbers divisible by $2$ or $3$ or $5 = 50 + 33 + 20 -16 -10 - 6 + 3 = 74$

Total number not divisible by $2$ or $3$ or $5 = 26$

Probability $ = 0.26$ [EDIT]
edited by
7 votes
7 votes

This is Brute Force method but takes very less time because we just need to check number is not div by 2,3 or 5.

Total no of possible outcomes N(s) = 100

N(e)=Number's not divisible by (2 OR 3 OR 5)  = (Not Div by 2  AND Not Div by 3 Not Div by 5 )      /// Demargon's law

N(e) = {1,7,11,13,17,19,23,29,31,37,41,43,47,49,53,59,61,67,71,73,77,79,83,89,91,97} = 26

Prob = N(e) / N(s) = 26/100 = 0.26

Answer is 0.26.
6 votes
6 votes
There are total 100 numbers, out of which 

50 numbers are divisible by 2, 
33 numbers are divisible by 3,
20 numbers are divisible by 5

Following are counted twice above
16 numbers are divisible by both 2 and 3
10 numbers are divisible by both 2 and 5
6 numbers are divisible by both 3 and 5

Following is counted thrice above
3 numbers are divisible by all 2, 3 and 5

So total numbers divisible by 2, 3 and 5 are = = 50 + 33 + 20 - 16 - 10 - 6 + 3 = 103 - 29 = 74 So probability that a number is number is not divisible by 2, 3 and 5 = (100 - 74)/100 = 0.26

Answer:

Related questions

47 votes
47 votes
3 answers
4
go_editor asked Sep 28, 2014
13,512 views
The number of distinct minimum spanning trees for the weighted graph below is _____