Have a query? Ask a Tutor!!

Access to best educators and exclusive paper discussions

Offsite Campus Turito Championship

Can’t find what you’re looking for?

Our tutors are from top schools around the world, and they are waiting for you 24/7, anytime, anywhere.

Homework- One to One Solutions
Understand concepts to solve better
Get your doubts solved instantly

Maths-

General

Easy

Question

If $n left parenthesis A intersection B equals 10 comma n open parentheses B intersection C close parentheses equals 20 right parenthesis$ and $n open parentheses A intersection C close parentheses equals 30 comma$ then the greatest possible value of $n left parenthesis A intersection B intersection C right parenthesis$ is

15
20
10
4

The correct answer is: 10

The greatest possible value of $n left parenthesis A intersection B intersection C right parenthesis$ is the least amongst the values $n open parentheses A intersection B close parentheses comma n left parenthesis B intersection C right parenthesis$ and $n left parenthesis A intersection C right parenthesis$ i.e. 10

Related Questions to study

Let $R$ be a relation from a set $A$ to a set $B comma$ then

Let $R$ be a relation from a set $A$ to a set $B comma$ then

In a town of $10000$ families $blank$ it was found that 40% families buy newspaper $A comma 20 percent sign$ families buy newspaper $B$ and 10% families buy newspaper $C comma blank 5 percent sign$ families buy $A$ and $B comma$ 3% buy $B$ and $C$ and 4% buy $A$ and $C.$ If 2% families buy all the three newspapers, then the number of families which buy $A$ only is

In a town of $10000$ families $blank$ it was found that 40% families buy newspaper $A comma 20 percent sign$ families buy newspaper $B$ and 10% families buy newspaper $C comma blank 5 percent sign$ families buy $A$ and $B comma$ 3% buy $B$ and $C$ and 4% buy $A$ and $C.$ If 2% families buy all the three newspapers, then the number of families which buy $A$ only is

Let $R$ be a reflexive relation on a finite set $A$ having $n$ elements, and let there be $m$ ordered pairs in $R.$ Then,

Let $R$ be a reflexive relation on a finite set $A$ having $n$ elements, and let there be $m$ ordered pairs in $R.$ Then,

parallel

For any two sets $A$ and $B$ , if $A intersection X equals B intersection X equals ϕ$ and $A union X equals B union X$ for some set $X$ , then

For any two sets $A$ and $B$ , if $A intersection X equals B intersection X equals ϕ$ and $A union X equals B union X$ for some set $X$ , then

Let $A equals open curly brackets 1 comma blank 2 comma blank 3 close curly brackets comma B equals open curly brackets 3 comma blank 4 close curly brackets comma C equals left curly bracket 4 comma blank 5 comma blank 6 right curly bracket$ . Then, $A union left parenthesis B intersection C right parenthesis$ is

Let $A equals open curly brackets 1 comma blank 2 comma blank 3 close curly brackets comma B equals open curly brackets 3 comma blank 4 close curly brackets comma C equals left curly bracket 4 comma blank 5 comma blank 6 right curly bracket$ . Then, $A union left parenthesis B intersection C right parenthesis$ is

If $A subscript 1 end subscript comma A subscript 2 end subscript comma horizontal ellipsis comma A subscript 100 end subscript$ are sets such that $n open parentheses A subscript i end subscript close parentheses equals i plus 2 comma A subscript 1 end subscript subset of A subscript 2 end subscript subset of A subscript 3 end subscript horizontal ellipsis subset of A subscript 100 end subscript$ and $not stretchy ⋂ from i equals 3 to 100 of A subscript i end subscript equals A comma$ then $n open parentheses A close parentheses equals$

If $A subscript 1 end subscript comma A subscript 2 end subscript comma horizontal ellipsis comma A subscript 100 end subscript$ are sets such that $n open parentheses A subscript i end subscript close parentheses equals i plus 2 comma A subscript 1 end subscript subset of A subscript 2 end subscript subset of A subscript 3 end subscript horizontal ellipsis subset of A subscript 100 end subscript$ and $not stretchy ⋂ from i equals 3 to 100 of A subscript i end subscript equals A comma$ then $n open parentheses A close parentheses equals$

parallel

If $A equals left curly bracket x blank colon x blank$ is a multiple of $blank 3 right curly bracket$ and,
$B equals left curly bracket x blank colon x blank$ is a multiple of $blank 5 right curly bracket$ , then $A minus B$ is

If $A equals left curly bracket x blank colon x blank$ is a multiple of $blank 3 right curly bracket$ and,
$B equals left curly bracket x blank colon x blank$ is a multiple of $blank 5 right curly bracket$ , then $A minus B$ is

Let $A$ be the set of all students in a school. A relation $R$ is defined on $A$ as follows:
$" a R b$ iff $a$ and $b$ have the same teacher”

Let $A$ be the set of all students in a school. A relation $R$ is defined on $A$ as follows:
$" a R b$ iff $a$ and $b$ have the same teacher”

In order that a relation $R$ defined on a non-empty set $A$ is an equivalence relation, it is sufficient, if $R$

In order that a relation $R$ defined on a non-empty set $A$ is an equivalence relation, it is sufficient, if $R$

parallel

Which of the following is an equivalence relation?

Which of the following is an equivalence relation?

Let $n open parentheses U close parentheses equals 700 comma blank n open parentheses A close parentheses equals 200 comma blank n open parentheses B close parentheses equals 300$ and $n open parentheses A intersection B close parentheses equals 100.$ Then, $n open parentheses A to the power of c end exponent intersection B to the power of c end exponent close parentheses equals$

Let $n open parentheses U close parentheses equals 700 comma blank n open parentheses A close parentheses equals 200 comma blank n open parentheses B close parentheses equals 300$ and $n open parentheses A intersection B close parentheses equals 100.$ Then, $n open parentheses A to the power of c end exponent intersection B to the power of c end exponent close parentheses equals$

The shaded region in the figure represents

The shaded region in the figure represents
Maths-General

parallel

Consider the following statements:
$p blank colon$ Every reflexive relation is symmetric relation
$q blank colon$ Every anti-symmetric relation is reflexive
Which of the following is/are true?

Consider the following statements:
$p blank colon$ Every reflexive relation is symmetric relation
$q blank colon$ Every anti-symmetric relation is reflexive
Which of the following is/are true?

The relation $R equals left curly bracket open parentheses 11 close parentheses comma open parentheses 22 close parentheses comma open parentheses 33 close parentheses comma open parentheses 12 close parentheses comma open parentheses 23 close parentheses comma left parenthesis 13 right parenthesis right curly bracket$ on set $A equals left curly bracket 12 comma 3 right curly bracket$ is

The relation $R equals left curly bracket open parentheses 11 close parentheses comma open parentheses 22 close parentheses comma open parentheses 33 close parentheses comma open parentheses 12 close parentheses comma open parentheses 23 close parentheses comma left parenthesis 13 right parenthesis right curly bracket$ on set $A equals left curly bracket 12 comma 3 right curly bracket$ is

On the set of human beings a relation $R$ is defined as follows:
$" a R b$ iff $a$ and $b$ have the same brother”. Then $R$ is

On the set of human beings a relation $R$ is defined as follows:
$" a R b$ iff $a$ and $b$ have the same brother”. Then $R$ is

parallel

card img

With Turito Academy.

card img

With Turito Foundation.

card img

Get an Expert Advice From Turito.

Turito Academy

card img

With Turito Academy.

Test Prep

card img

With Turito Foundation.