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 $A equals open curly brackets a comma b comma c comma l comma m comma n close curly brackets comma$ then the maximum number of elements in any relation on $A$ is

12
16
32
36

The correct answer is: 36

Any relation on $A$ is a subset of $A cross times A$ which contains 36 elements. Hence, maximum number of elements in a relation on $A$ can be 36

Related Questions to study

If $X equals left curly bracket 4 to the power of n end exponent minus 3 n minus 1 blank colon n element of N right curly bracket$ and $Y equals open curly brackets 9 open parentheses n minus 1 close parentheses colon n element of N close curly brackets comma$ then $X union Y$ is equal to

If $X equals left curly bracket 4 to the power of n end exponent minus 3 n minus 1 blank colon n element of N right curly bracket$ and $Y equals open curly brackets 9 open parentheses n minus 1 close parentheses colon n element of N close curly brackets comma$ then $X union Y$ is equal to

Let $X$ be the set of all engineering colleges in a state of Indian Republic and $R$ be a relation on $X$ defined as two colleges are related iff they are affiliated to the same university, then $R$ is

Let $X$ be the set of all engineering colleges in a state of Indian Republic and $R$ be a relation on $X$ defined as two colleges are related iff they are affiliated to the same university, then $R$ is

Let $X$ and $Y$ be the sets of all positive divisors of 400 and 1000 respectively (including 1 and the number). Then, $n left parenthesis X intersection Y right parenthesis$ is equal to

Let $X$ and $Y$ be the sets of all positive divisors of 400 and 1000 respectively (including 1 and the number). Then, $n left parenthesis X intersection Y right parenthesis$ is equal to

parallel

Let $S equals left curly bracket 1 comma blank 2 comma blank 3 comma blank 4 right curly bracket$ . The total number of unordered pairs of disjoint subsets of $S$ is equal to

Let $S equals left curly bracket 1 comma blank 2 comma blank 3 comma blank 4 right curly bracket$ . The total number of unordered pairs of disjoint subsets of $S$ is equal to

If $A equals left curly bracket p colon p equals fraction numerator open parentheses n plus 2 close parentheses open parentheses 2 n to the power of 5 end exponent plus 3 n to the power of 4 end exponent plus 4 n to the power of 3 end exponent plus 5 n to the power of 2 end exponent plus 6 close parentheses over denominator n to the power of 2 end exponent plus 2 n end fraction comma n comma p element of Z to the power of plus end exponent right curly bracket$ then the number of elements in the set $A comma$ is

If $A equals left curly bracket p colon p equals fraction numerator open parentheses n plus 2 close parentheses open parentheses 2 n to the power of 5 end exponent plus 3 n to the power of 4 end exponent plus 4 n to the power of 3 end exponent plus 5 n to the power of 2 end exponent plus 6 close parentheses over denominator n to the power of 2 end exponent plus 2 n end fraction comma n comma p element of Z to the power of plus end exponent right curly bracket$ then the number of elements in the set $A comma$ is

For any three sets $A subscript 1 end subscript comma A subscript 2 end subscript comma A subscript 3 end subscript comma$ let $B subscript 1 end subscript equals A subscript 1 end subscript comma B subscript 2 end subscript equals A subscript 2 end subscript minus A subscript 1 end subscript$ and $B subscript 3 end subscript equals A subscript 3 end subscript minus open parentheses A subscript 1 end subscript union A subscript 2 end subscript close parentheses comma$ then which one of the following statement is always true

For any three sets $A subscript 1 end subscript comma A subscript 2 end subscript comma A subscript 3 end subscript comma$ let $B subscript 1 end subscript equals A subscript 1 end subscript comma B subscript 2 end subscript equals A subscript 2 end subscript minus A subscript 1 end subscript$ and $B subscript 3 end subscript equals A subscript 3 end subscript minus open parentheses A subscript 1 end subscript union A subscript 2 end subscript close parentheses comma$ then which one of the following statement is always true

parallel

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

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

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

parallel

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,

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

parallel

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$

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”

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.