Test: Sets- 2

It is given that the given set of 4 elements is group. The element 'e' is clearly identity as the row corresponding to it has all values same as the other operand. Also, since a*c is e, c*a should also be e which is only the case in option D

• A partially ordered set L is called a complete lattice if every subset M of L has a least upper bound called as supremum and a greatest lower bound called as infimum.
• We are given a set containment relation.
• So, supremum element is union of all the subset and infimum element is intersection of all the subset.
• Set S is not complete lattice because although it has a supremum for every subset, but some subsets have no infimum. We take subset {{1,3,5},{1,2,4}}.Intersection of these sets is {1}, which is not present in S. So we have to add set {1} in S to make it a complete lattice

Thus, option (A) is correct. Please comment below if you find anything wrong in the above post.

Let there be total number of edges of a graph to be formed be e and total number of vertices be n.

So the total number of ways a graph can be formed having exactly e edges and v vertices is given by the total number of ways we can select e edges among v edges

i. e.

C (v, e)

Now, here e = (n² – 3n)/2 and v = n(n-1)/2 (maximum number of edges in a simple graph).

So to select a edge we can do that in C (v, (n² – 3n)/2) ways.

Since minimum no. of edges to be selected for a graph are (n² – 3n)/2.

So total number of graphs possible will be :

C(v, e) + C(v, e+1) + C(v, e+2) +…………...+ C(v, v).

C(v, v-e) + C(v, v-(e+1)) + C(v, v-(e+2)) +…………...+ C(v, v-v).

Since v - e = n(n-1)/2 - (n² – 3n)/2 = n

Therefore

C(v, n) + C(v, n-1) + C(v, n-2) +…………...+ C(v, 0).

Solving this we will get

'a' and 'b' are given as minimal elements. No other element in S is of lower order than either a or b. 'c' is given as maximum element. So, c is of higher order than any other element in S. 
P(a) = True means all elements 'x' which have an edge from element 'a' have to be true. Since there is an edge from 'a', we have to satisfy formula P(a) => P(x), which can only be done by setting P(x) = True. 
Elements which have an edge from b can be anything because formula P(b) => P(x) is satisfied as P(b) = False. 
(A) This statement is true because making all elements true trivially satisfy formula P(x) => P(y). 
(B) This statement is true if all elements are connected from b then all elements can be false. 
(C) This statement is true because b<=x ensures x!=a and for all other elements P(x) can be false without violating the given implication. 
(D) This statement is false. Since, P(a) = true , for all 'x' such that a<=x, P(x) must be true. We do have at least one such 'x', which is 'c' as it is the maximum element. 
 
Thus, option (D) is the answer. 
 
Please comment below if you find anything wrong in the above post.

Since, the answer is a product of three prime numbers 2, 3 and 5. So, we have three non-empty sequence of strings : "a", "a" and "a". 
f(s) = 2^x for some x Since, 7 and 9 are not multiple of 2. So, options (A) and (C) are eliminated. 
f(a) = 2³ = 8 h = 2⁸ 3⁸5⁸ 
 
Thus, option (B) is correct. 
 
Please comment below if you find anything wrong in the above post.

A group is a set of elements such that any two elements of the group combine to form a third element of the same group. Also, a group must satisfy certain properties: Closure Property - Any two elements of the set when operated open by an operator form a third element that must also be in the set. Associative Property - For an expression with three or more operands having the same operator between them, the order of operation does not matter as long as the sequence of operands are not changed. For example, (a + b) + c = a + (b + c). Identity element Property - Each set must have an identity element, which is an element of the set such that when operated upon with another element of the set, it gives the element itself. For example, a + 0 = a. Here, 0 is the identity element. Invertibility Property - For each element of the set, inverse should exist.   Now, for the given statements, we have A is incorrect as it does not satisfies closure property. If we take two negative numbers and multiply them, we get a positive number which is not in the set. B is correct. The matrices in the set must be non - singular, i.e., their determinant should not be zero, for the inverse to exist (Invertibility Property). C is incorrect as the inverse of a singular (determinant = 0) matrix does not exist (Invertibility Property violated). Thus, B is the correct option. Please comment below if you find anything wrong in the above post.

• Reflexive : A relation is reflexive if every element of set is paired with itself. Here none of the element of A is paired with themselves, so S is not reflexive.
• Symmetric : This property says that if there is a pair (a, b) in S, then there must be a pair (b, a) in S. Since there is no pair here in S, this is trivially true, so S is symmetric.
• Transitive : This says that if there are pairs (a, b) and (b, c) in S, then there must be pair (a,c) in S. Again, this condition is trivially true, so S is transitive. Thus, option (D) is correct. Please comment below if you find anything wrong in the above post.

So basically, we have to tell whether these relations are equivalence or not.

1. R1(a,b)

• Reflexive : Yes, because (a+a) is even.
• Symmetrix : Yes, (a+b) is even ⟹ (b+a) is even.
• Transitive : Yes, because (a+b) is even and (b+c) is even ⟹ (a+c) is even.

So R1 is equivalence relation.

2. R2(a,b)

• Reflexive : No, because (a+a) is even.

So R2 is not equivalence relation.

3. R3(a,b)

• Reflexive : Yes, because a.a > 0.
• Symmetrix : Yes, a.b > 0 ⟹ b.a > 0.
• Transitive : Yes, because a.b > 0 and b.c > 0 ⟹ a.c > 0.

So R3 is equivalence relation.

4. R4(a,b)

• Reflexive : Yes, because |a-a| ≤ 2.
• Symmetrix : Yes, |a-b| ≤ 2 ⟹ |b-a| ≤ 2.
• Transitive : No, because |a-b| ≤ 2 and |b-c| ≤ 2 ⇏ (a-c) is even.

So R4 is not equivalence relation.

S1: A ∩ (B ∪ C) Here S1 is finite where A, B, C are infinite We’ll prove this by taking an example. Let A = {Set of all even numbers} = {2, 4, 6, 8, 10...} Let B = {Set of all odd numbers} = {1, 3, 5, 7...........} Let C = {Set of all prime numbers} = {2, 3, 5, 7, 11, 13......} B U C = {1, 2, 3, 5, 7, 9, 11, 13......} A ∩ (B ∪ C) Will be equals to: {2} which is finite. I.e. using A, B, C as infinite sets the statement S1 is finite. So, statement S1 is correct. S2: There exists two irrational numbers x, y such that (x+y) is rational To prove this statement as correct, we take an example. Let X = 2-Sqrt (3), Y = 2+Sqrt (3) => X, Y are irrational X+Y = 2+Sqrt (3) + 2-Sqrt (3) = 2+2 = 4 So, statement S2 is also correct. Answer is Option C Both Statements S1, S2 are correct.

There are 2 2 equivalence classes. 1) All odd integers. (Reflexive as sum of two even is even, Symmetric and Transitive as + operation is Symmetric and Transitive) 2) All Even Integers. (Reflexive as sum of two odd is even, Symmetric and Transitive as + operation is Symmetric and Transitive)

Ex:  let a set ‘s’ be, s={1,2} Power-set(s)=P(s)={{},{1},{2},{1,2}} Note: ‘{}’ denotes empty or NULL set or φ. In general, if a set ‘s’ contains ‘n’ elements,  power-set will contain 2^n elements, that denotes set of all subset of ‘s’. Solution: Option (a): P(P(S))=P(S) If, S={1} P(S)={ φ, {1}} P(P(S))={ φ,{ φ},{1},{ φ, {1}}} NOTE: LHS is set of set of subsets of ‘S’ and RHS is set of subsets of ‘S’. So, we can conclude this option is false. Option (b): P(P(S)) ∩P(S)={ φ}. If, S={1} P(S)={ φ, {1}} P(P(S))={ φ,{ φ},{1},{ φ, {1}}} P(P(S)) ∩P(S)= { φ}=RHS So, we can conclude this option is TRUE. Option (a): P(S) ∩S=P(S) If, S={1} P(S)={ φ, {1}} P(S) ∩S= φ NOTE: We can’t find anything common in set of elements (S) and set of sets(P(S)). So, we can conclude this option is false. Option (a): S ∉ P(S) If, S={1} P(S)={ φ, {1}} Clearly, S is subset of P(S). NOTE: By definition only, its clear that power-set is set of all subset that will contain S also. So, we can conclude this option is false.

The operation is basically XOR which is both commutative and associative.

Number of triplets in L³ = Number of ways in which we can choose 3 elements from 5 with repetition = 5 * 5 * 5 = 125.

Now, when we take x = t, then the given condition for L is satisfied for any y and z. Here, y and z can be taken in 5 * 5 = 25 ways.

Take x = r, y = p, z = p. Here also, the given condition is satisfied. So, pr > 25 / 125 > 1/5.

For x = q, y = r, z = s, the given condition is not satisfied as q ⋁ (r ⋀ s) = q ⋁ p = q, while (q ⋁ r) ⋀ (q ⋁ s) = t ⋀ t = t.

So, pr ≠ 1.

Hence D choice.

R cannot be reflexive as 'a' and 'b' have to be distinct in aRb. R is symmetric if a and b have a common divisor, then b and a also have. R is not transitive as aRb and bRc doesn't mean aRc. For example 3 and 15 have common divisor, 15 and 5 have common divisor, but 3 and 5 don't have.

The power set has 2ⁿ elements. For n = 11, size of power set is 2048.

So the full outer join contains e = (1, 5, 7), f = (3, 7, null), g = (4, null, 9).

A function f from X to Y is called onto if for all 'y' in Y there is an 'x' in X such that f(x) = y.          In onto functions, all elements in Y are used. Source: http://www.regentsprep.org/regents/math/algtrig/atp5/OntoFunctions.htm Every Surjective or Onto function sends two elements of {1, 2, 3, 4} to the same element of {a, b, c}. There are ⁴C₂ = 6 such pairs of elements. The pairs are {1, 2}, {1, 3}, {1, 4}, {2, 3}, {2, 4}, {3, 4}. For a given pair {i, j} ⊂ {1, 2, 3, 4}, there are 3! sujective functions such that f(i) = f(j). Hence there are total 6 * 6 = 36 surjective functions.

X has 2 elements Y has 20 elements Number of functions from X to Y is 20*20 [Every element can take any of the 20 values] Number of one to one functions from X to Y is 20*19 [Every element takes a different value] So probability of a function being one to one = (20*19) / (20*20) = 380 / 400 = 0.95

((p, q), (r, s)) ∈ R if and only if p–s = q–r (p, q) is not related to (p, q) as p-q is not same as q-p.
The relation is symmetric because if p–s = q–r, then s-q = s-p.

As i already mentioned, even if there is small scope of getting solution by substitution method, Just go for it...!! Here let n=2 A = {1, 2} All subsets formed by A are: - {}, {1}, {2}, {1,2}. C is a collection of distinct subsets such that for any S1, S2 either S1⊂S2 or S2⊂S1. So for C, {} null set can be included always since it null. set is a subset of every set. We can choose one from either {1} or {2}, {1,2} can be included to maximise the cardinality. So, here 1) If {1} is chosen then C = {}, {1}, {1,2} here every set is subset of other. 2) If {2} is chosen then C = {}, {2}, {1,2} here also every set is subset of other. So, answer should be 2 but it incluedes empty set also therefore the maximum cardinality of C is 3.

R1 is a relation from A = {1, 3, 5, 7} to B = {2, 4, 6, 8} . Under R1, an element x in A is related to an element y in B if x + y is divisible by 3. 
Thus, R1 = {(1, 2), (1, 8), (3, 6), (5, 4), (7, 2), (7, 8)} 
R2 is a relation from B = {2, 4, 6, 8} to C = {1, 2, 3, 4} Under R2, an element y in B is related to an element z in C if y + z is even but not divisible by 3. 
Thus, R2 = {(2, 2), (4, 4), (6, 2), (6, 4), (8, 2)} 

Thus, R1R2 = {(1, 2), (3, 2), (3, 4), (5, 4), (7, 2)} 
 
Thus, option (C) is correct. 
 
Please comment below if you find anything wrong in the above post.

Let us assume: f(1) = x. Then,
f(2) = f(2/2) = f(1) = x
f(3) = f(3+5) = f(8) = f(8/2) = f(4/2) = f(2/1) = f(1) = x
Similarly, f(4) = x f(5) = f(5+5) = f(10/2) = f(5) = y.

So it will have two values. All multiples of 5 will have value y and others will have value x. It will have 2 different values.

THEORY: REFLEXTIVE RELATION:   A relation ‘R’ on a set ‘A’ is said to be reflexive if, (xRx) for every x£A. Ex. If A= {1,2} And R, and P be a relation on AxA, defined as, R= {(2,2),(1,1)} => R is reflexive as it contains all pair of type (xRx). P= {(1,1)} => P is not reflexive relation on A, as it doesn’t contain (2,2).   TRANSITIVE RELATION: A relation ‘R’ on set ‘A’ is said to be transitive if (xRy) and (yRz), then (xRz) for every x,y,z £A. Ex: if A= {1,2} Let R be a relation on AxA, defined as, R= {(1,1),(1,2),(2,1)} => R is transitive.  SOLUTION: Given, (a, b) R (c, d) if a <= c or b <= d i.Check for reflexivity: if an element of set be (a,b) then, (a,b)R(a,b) should hold true. Here, a<=a or b<=b. So, (a,b)R(a,b) holds true. Hence, ‘R’ is reflexive. ii. Check for transitivity:  if elements of set be (2,3),(3,1) and(1,1) Then, (2,3)R(3,1) as 2<=3 And (3,1)R(1,1) as 1<=1 But (2,3)R(1,1) doesn’t hold true as 2>=1 and 3>=1. Hence, R is reflexive but not transitive. 

I f(x,y) = x+y-3 = x= y+x-3  =>  y=3 Here identity elements is 3 II f(x,y) = max(x,y)=x=max(y,x)  => y=1 Here identity elements is 1 (III f(x,y) =x^y is not same as f(y,x) = y^x. So no identity element.

Option A: f (x₁, x₂, …, x_n) = x₁’f(x₁, x₂, …, x_n) + x₁f(x₁, x₂, …, x_n) Case 1: taking x₁=0 RHS = 1.f(x₁, x₂, …, x_n) + 0.f(x₁, x₂, …, x_n) RHS =f(x₁, x₂, …, x_n). Case 2: taking x1=1 RHS = 0.f(x₁, x₂, …, x_n) + 1.f(x₁, x₂, …, x_n) RHS =f(x₁, x₂, …, x_n). In both cases RHS=LHS, so, (A) is true Option B: f (x₁, x₂, …, x_n) = x₂f(x₁, x₂, …, x_n) + x₂’f(x1, x₂, …, x_n) Case 1: taking x₂=0 RHS= 0.f(x₁, x_2, …, x_n) + 1.f(x₁, x₂…,x_n) RHS =f(x₁, x₂, …, x_n).Case 2: taking x₂=1 RHS = 1.f(x₁, x₂, …, x_n) + 0.f(x₁, x₂, …, x_n) RHS =f(x₁, x₂, …, x_n). In both cases RHS=LHS, so, (B) is true. Option C: f (x₁, x₂, …, x_n) = x_n’f(x₁, x₂, …, 0) + x_nf(x₁, x₂, …,1) Case 1: taking x_n=0 RHS= 1.f(x₁, x₂, …, 0) + 0.f(x₁, x₂, …, 1) RHS =f(x₁, x₂, …, 0) Case 2: taking x_n=1 RHS = 0.f(x₁, x₂, …, 0) + 1.f(x₁, x₂, …, 1) RHS =f(x₁, x₂, …, 1)In both cases RHS=LHS, so, (C) is true. Option D: f (x₁, x₂, …, x_n) = f(0, x₂, …, x_n) + f(1, x₂, .., x_n) Here, no way to equate LHS and RHS so ‘NOT true’. NO term depends on value of ‘x1’. 

VxVy R(x,y) => R(y,x) The above given relation is symmetry But, we have both symmetric relastions possible and also possibility of anti symmetric relation  But neither of always holds for all possibilites of sets. => Both are satisfiable but not valid This solution is contributed by Anil Saikrishna Devarasetty. One more solution : We are given a logical formula. So, to be valid it must be a symmetric relation. Hence, Option A is incorrect. Since, it is a logical formula => it is along with it's negation is satisfiable. Hence, option B is correct.