Register

wts shortcut to solve this kind of question

3,653 views
0 votes
0 votes
Consider a set A = {1, 2, 3, …….., 1000}. How many members of A shall be divisible by
3 or by 5 or by both 3 and 5 ?
(A) 533 (B) 599
(C) 467 (D) 66
User Avatar

1 Answer

Best answer
8 votes
8 votes
(A U B ) = (A) + (B) - (A ∩ B)

A=1000/3 = 333   [No's divisible by 3]

B=1000/5=200     [No's divisible by 5]

A ∩ B= 1000/15=66       [No's divisible by both 3 and 5]

A U B = 333+200-66=533-66=467
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
shashank joshi asked Nov 18, 2018
417 views
test series brilliant classes what approach we have use to solve these kind of questions
Q- the Grammer S-> aSb | bSa |SS |Ɛ a) unambiguous CFG b) ambiguous CFG c) not a CFG d) deterministic CFG
Q- the Grammer S- aSb | bSa |SS |Ɛa) unambiguous CFGb) ambiguous CFGc) not a CFGd) deterministic CFG
User Avatar
2 votes
2 votes
1 answer
2
shivanisrivarshini asked Apr 21, 2016
672 views
How to solve These Kind of problems
User Avatar
1 votes
1 votes
1 answer
3
Ravi Raaja asked Nov 16, 2015
592 views
how to approach this kind of questions , any algorithm ???
Which one of the following strings is not accepted by the finite automaton described by the regular expression $(0+1(01^*0)^*1)^*$? $1100100011011001011$ $0110100010111010010$ $0100011010111010101$ $1101001101100010011$
Which one of the following strings is not accepted by the finite automaton described by the regular expression $(0+1(01^*0)^*1)^*$?$1100100011011001011$$01101000101110100...
User Avatar
0 votes
0 votes
1 answer
4
Shimpy Goyal asked Jun 26, 2015
822 views
wts mean of this statement??
In 2’s complement the significant information is contained in the 1’s of positive numbers and 0’s of the negative numbers.
In 2’s complement the significant information is contained in the 1’s of positive numbers and 0’s of the negative numbers.
User Avatar
Link Copied!