Professional Documents
Culture Documents
Assignment
Name Registration No. Learning Center Learning Center Code Course Subject Semester Module No. Date of submission Marks awarded
Directorate of Distance Education Sikkim Manipal University II Floor, Syndicate House Manipal 576104
ROLLNUMBER
Comments by the Subject Evaluator: _____________________________________________________________________ _____________________________________________________________________ _____________________________________________________________________ _____________________________________________________________________ _____________________________________________________________________ _____________________________________________________________________ _____________________________________________________________________ _____________________________________________________________________ _____________________________________________________________________ _____________________________________________________________________ _____________________________________________________________________ _____________________________________________________________________
Suggestions for improvement: _____________________________________________________________________ _____________________________________________________________________ _____________________________________________________________________ _____________________________________________________________________ _____________________________________________________________________ _____________________________________________________________________ _____________________________________________________________________ _____________________________________________________________________ _____________________________________________________________________ _____________________________________________________________________ _____________________________________________________________________ _____________________________________________________________________
ROLLNUMBER
Define the concept of equivalence relation. Give at least two examples of equivalence relation.
Answer 1: Definition: A relation R on a set A is an equivalence relation if and only if R is Reflexive, Symmetric Transitive The definition is motivated by observing that any process of identification must behave somewhat like the equality relation , and the equality relation satisfies the reflexive (x = x for all x), symmetric (x = y implies y = x), and transitive (x = y and y = z implies x = z) properties. Example: I. Let R be the relation on the set R real numbers defined by xRy i x y is an integer. Prove that R is an equivalence relatio n on R. Proof: a. Reflexive: Suppose x R. Then x x = 0, which is an integer. Thus, xRx. b. Symmetric: Suppose x, y R and xRy. Then x y is an integer. Since y x = (x y), y x is also an integer. Thus, yRx. c. Transitive: Suppose x, y R, xRy and yRz. Then x y and y z are integers. Thus, the sum (x y) + (y z) = x z is also an integer, and so xRz. Thus, R is an equivalence relation on R. # II. Let R be the relation on the set of real numbers Prove that if xRx ' and yRy' , then (x + y)R(x' + y'). Proof: Suppose xRx ' and yRy '. In order to show that (x + y) R (x + y'), we must show that (x + y) (x ' + y') is an integer. Since (x + y) (x'+ y') = (x x') + (y y'), and since each of xx ' and y y ' is an integer (by denition of R), (xx') + (y y ') is an integer. Thus, (x + y) R (x ' + y').
ROLLNUMBER
n 2 (n +1 )2 4
Induction Hypothesis: Assume that the result to be true for n=m then
2 2 ( m 1 ) 3 3 3 m 1 2 ... m 4
3
th
There for the result is true for n = m + 1. Hence the mathematical induction, the given result is true for all positive integer n.
ROLLNUMBER
Let G be a connected graph. If G has no circuit, then G is a spanning tree. If G has a circuit, then delete an edge from this circuit. If till leaves the graph connected. If there are more circuits, repeat the operation till an edge from the last circuit is deleted, leaving the graph connected, circuit-less, and contains all the vertices of G. Thus the sub-graph obtained is a spanning tree of G. Hence every connected graph has at least one spanning tree.
ROLLNUMBER
ROLLNUMBER
ROLLNUMBER
ROLLNUMBER