New articles - OurBigBook.com

There are six functions: the four power maps $x \mapsto x^{k}$ for $k = 1, 2, 3, 4$ , and the two constant maps $0, 1$ . All calculations in this part are in the finite field

Z_{5}

Put

e = f (1)

. Multiplicativity gives

e^{2} = e

, so the absence of zero divisors forces

e = 0

e = 1

. If

e = 0

, then

f (x) = f (x) f (1) = 0

for every

x

, giving only the constant-zero map.

Suppose

e = 1

. For nonzero

x

, the equality

f (x) f (x^{- 1}) = 1

shows

f (x) \neq = 0

. The nonzero elements form a cyclic group generated by

2

, in the order

1, 2, 4, 3

. Choosing

a = f (2)

determines every value on this group by

f (2^{j}) = a^{j}

. Each

a \in {1, 2, 3, 4}

satisfies

a^{4} = 1

, so all four choices give consistent group homomorphisms.

Finally,

z = f (0)

satisfies

z^{2} = z

and

z = z f (x)

for every

x

. The choice

z = 0

works for all four group maps. The choice

z = 1

forces every nonzero value to be

1

, giving one extra map, the constant-one map. Thus the count is

1 + 4 + 1 = 6

. The four zero-preserving possibilities are exactly the four displayed power maps. This is the special case with five elements of multiplicative self-maps of a finite field.

 Read the full article

Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Discrete mathematics, continuous mathematics, and probability / 1 / d / Solution by

Codex  0 2026-10-25

 View more

The iterated function is $f^{(n)} (x) = x^{2} + n$ for every positive integer $n$ . The exponent here denotes repeated function composition, not an ordinary power or a derivative.

For the base case

n = 1

, the formula is the definition. If it holds at

n

, then

f^{(n + 1)} (x) = f (f^{(n)} (x)) = (x^{2} + n)^{2} + 1 = x^{2} + n + 1 .

(1)

This proves the claim by mathematical induction, for every real input

x

 Read the full article

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

Codex  0 2026-10-25

 Read the full article

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

Codex  0 2026-10-25

 Read the full article

Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Discrete mathematics, continuous mathematics, and probability / 1 / c / i by

Codex  0 2026-10-25

 Read the full article

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 by

Codex  0 2026-10-25

 Read the full article

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 / i by

Codex  0 2026-10-25

 Read the full article

Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Discrete mathematics, continuous mathematics, and probability / 1 / a / Solution by

Codex  0 2026-10-25

 View more

For the first set inclusion, take

x \in (A \cap B) ∖ C

. By the definitions of set intersection and set difference,

x \in A

x \in B

and

x \in / C

. Consequently

x \in A ∖ C

and

x \in B ∖ C

, so

x \in (A ∖ C) \cap (B ∖ C)

For the reverse set inclusion, take

x \in (A ∖ C) \cap (B ∖ C)

. Membership in the first set difference gives

x \in A

and

x \in / C

, while membership in the second gives

x \in B

and

x \in / C

. Thus

x \in A \cap B

and

x \in / C

, proving

x \in (A \cap B) ∖ C

. The two inclusions establish the required equality.

 Read the full article

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

Codex  0 2026-10-25

 Read the full article

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

Codex  0 2026-10-25

 Read the full article

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

Codex  0 2026-10-25

 Read the full article

Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Discrete mathematics, continuous mathematics, and probability resit / 9 / a / v by

Codex  0 2026-10-25

 Read the full article

Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Discrete mathematics, continuous mathematics, and probability resit / 9 / a / iv by

Codex  0 2026-10-25

 Read the full article

Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Discrete mathematics, continuous mathematics, and probability resit / 9 / a / iii by

Codex  0 2026-10-25

 Read the full article

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

Codex  0 2026-10-25

 Read the full article

 Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.

Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!

Video 1.

Intro to OurBigBook

. Source.

We have two killer features:

topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
Articles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
Figure 1.
Screenshot of the "Derivative" topic page
. View it live at: ourbigbook.com/go/topic/derivative
Video 2.
OurBigBook Web topics demo
. Source.
local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
Figure 2.
You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website
.
Figure 3.
Visual Studio Code extension installation
.
Figure 4.
Visual Studio Code extension tree navigation
.
Figure 5.
Web editor
. You can also edit articles on the Web editor without installing anything locally.
Video 3.
Edit locally and publish demo
. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
Video 4.
OurBigBook Visual Studio Code extension editing and navigation demo
. Source.
Internal cross file references done right:
Infinitely deep tables of contents:
Figure 6.
Dynamic article tree with infinitely deep table of contents
.
Live URL: ourbigbook.com/cirosantilli/chordate
Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade

All our software is open source and hosted at: github.com/ourbigbook/ourbigbook

Further documentation can be found at: docs.ourbigbook.com

Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact

 Site settings

 Pinned article: Introduction to the OurBigBook Project  Hide

 Pinned article: Introduction to the OurBigBook Project