목록All Contents (169)
Code&Data Insights
[Techniques in Symbolic Computation] Equivalence classes / Diophantine equation / Bezout's Identity
Problem ) Verify that the relation, two ordered pairs(a,b) and (c,d) are equivalent if ad= bc, is an equivalence relation on the set S of all ordered pairs (a, b) of integers with b̸=0. --> (1) reflexive : For all (a, b) ∈ X, ab = ba. This is clearly true. Hence R is reflexive. (2) symmetric : For all (a,b),(c,d) ∈ X, suppose (a,b)R(c,d). Then ad = bc if and only if cb = ..
Computer Science/Comp sci_courses
2022. 1. 20. 06:32