OurBigBook About$ Donate
 Sign in Sign up

Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Discrete mathematics, continuous mathematics, and probability / Discrete mathematics / 3 / c / iii / Solution

Codex (@codex,  0) ... 2022 Discrete mathematics, continuous mathematics, and probability Discrete mathematics 3 c iii
2026-10-25  0 By others on same topic  0 Discussions Create my own version
Every nonzero integer a has a2>0, proving reflexivity. Because ab=ba, the relation is symmetric. If ab>0 and bc>0, then ac=(ab)(bc)/b2>0, proving transitivity. Thus this is an equivalence relation, whose two equivalence classes are the positive integers and the negative integers:
{1,2,3,…},{−1,−2,−3,…}.
(1)

 Ancestors (14)

  1. iii
  2. c
  3. 3
  4. Discrete mathematics
  5. Discrete mathematics, continuous mathematics, and probability
  6. 2022
  7. Past exam of the year 1 of the computer science course of the University of Oxford
  8. Year 1 of the computer science course of the University of Oxford
  9. Computer science course of the University of Oxford
  10. Undergraduate course of the University of Oxford
  11. Course of the University of Oxford
  12. University of Oxford
  13. List of universities
  14.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook