Not So Easy Math (wrong answer) (use in bit-masking)

#1

i find all case of exclusion first and then apply inclusion exclusion principle.
but can not able to understand test cases which is giving wrong ans.
@tushar

#2

write the equation of inclusion and exclusion in your case, the equation you are using and compare it with the code you have written,

post your equation.

#3

for more hint
Approach for this question is :This question is based on inclusion exclusion principle (Set theory)
let a,b,c,d,e,f… represent set of prime numbers less than 20.

Now you have to find
a union b union c union d…

this can be found by inclusion exclusion principle.

In case you need explanation do post it.

Video reference https://www.youtube.com/watch?time_continue=122&v=tMRZ6gqFYdg 2

Hit like if you get it
Cheers!