Equivalent Relations
Here is a “proof” that every relation C that is both symmetric and transitive is also reflexive: “Since C is symmetric, aCb implies bCa. Since C is transitive, aCb and bCa together imply aCa, as desired.” Find the flaw in this argument.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.