Today I am going to tell you about the Conjunction. Conjunction is a very interesting part of discrete math, it is essentially a logical function of binary that having a two place logical operator. This function is applied on two or more logical operands which results in either false/true or 0/1. Conjunction in discreet maths always returns true (1) value if both of its operands have true value else it will return false (0). It is represented as AND. Its logical sign is >.
Here we will take some examples to understand the main concept behind this:
1. Let there are two operands say A, B where A = 0 and B = 0 then A>B = 0.
2. Similarly if A = 1 and B = 1 then A>B = 1.
3. If A = 0 and B = 1 then A>B = 0 and vice versa. (To get help on icse board books click here)
So from the above examples we get to know that whenever the value of A and B is 1(TRUE) then the result or conjunction of A and B is also TRUE (1) else FALSE (0).
Similar to Disjunction (OR) it also has some properties which help us to solve questions related to this. These properties are: Consider we have 3 logical operands say A, B, C then
1. Commutative: Conjunction of A and B is equal to the conjunction of B and C i.e. A>B = B>A.
2. Associative: According to this property A> (B>C) = (A>B) >C.
3. Distributive: This property has two operations AND and OR. i.e. A>(BVC) = (A>B)V(A>C).
4. Identity potency: According to this property Conjunction of an operator to itself always results in the same operator i.e. A>A = A.
So by using these properties of conjunctions we can solve any problems related to finding conjunctions. Today we got some interesting knowledge about conjunctions. In the next topic we will discuss about the disjunctions and In the next session we will discuss about Conditional in Discreet Math.
Here we will take some examples to understand the main concept behind this:
1. Let there are two operands say A, B where A = 0 and B = 0 then A>B = 0.
2. Similarly if A = 1 and B = 1 then A>B = 1.
3. If A = 0 and B = 1 then A>B = 0 and vice versa. (To get help on icse board books click here)
Similar to Disjunction (OR) it also has some properties which help us to solve questions related to this. These properties are: Consider we have 3 logical operands say A, B, C then
1. Commutative: Conjunction of A and B is equal to the conjunction of B and C i.e. A>B = B>A.
2. Associative: According to this property A> (B>C) = (A>B) >C.
3. Distributive: This property has two operations AND and OR. i.e. A>(BVC) = (A>B)V(A>C).
4. Identity potency: According to this property Conjunction of an operator to itself always results in the same operator i.e. A>A = A.
So by using these properties of conjunctions we can solve any problems related to finding conjunctions. Today we got some interesting knowledge about conjunctions. In the next topic we will discuss about the disjunctions and In the next session we will discuss about Conditional in Discreet Math.
No comments:
Post a Comment