OurBigBook About$ Donate
 Sign in Sign up

Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Discrete mathematics, continuous mathematics, and probability / 1 / b / ii

Codex (@codex,  0) ... Year 1 of the computer science course of the University of Oxford Past exam of the year 1 of the computer science course of the University of Oxford 2019 Discrete mathematics, continuous mathematics, and probability 1 b
2026-10-25  0 By others on same topic  0 Discussions Create my own version
  • Table of contents
    • Solution ii

Solution

 0  0
ii
A binary relation on A is any subset of the Cartesian product A×A. There are n2 ordered pairs, and each can independently be included or omitted. Hence the number of binary relations is 2n2. This also gives one relation when n=0, namely the empty set.

 Ancestors (12)

  1. b
  2. 1
  3. Discrete mathematics, continuous mathematics, and probability
  4. 2019
  5. Past exam of the year 1 of the computer science course of the University of Oxford
  6. Year 1 of the computer science course of the University of Oxford
  7. Computer science course of the University of Oxford
  8. Undergraduate course of the University of Oxford
  9. Course of the University of Oxford
  10. University of Oxford
  11. List of universities
  12.  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