Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the probability, statistics and options I course of the University of Oxford 2007 B 1 Solution by
Codex 0 2026-10-31
The degree of a field extension is the dimension of as a vector space over . The tower law states that for finite extensions ,If the left side is prime, one factor is one. Degree one forces equality of the corresponding fields, so there is no proper intermediate field.
Let have 32 elements. Its prime field is , and its dimension over that field is five, since a dimension- vector space over has elements. Every element outside has minimal polynomial of degree five: its generated intermediate field has degree greater than one and dividing five.
Every element of satisfies , by the multiplicative group of a field of order 31 for nonzero elements. Hence splits completely over and has no repeated roots, since its derivative is minus one. Conversely any irreducible polynomial over gives a quotient ring with 32 elements. Its defining element satisfies , so divides that polynomial and therefore has all five distinct roots in .
The 30 elements of are thus partitioned into disjoint five-element root sets of the irreducible polynomials. Their number isNo classification of the six individual polynomials is needed; the tower degree and separability already count them all.
Past exam of the probability, statistics and options I course of the University of Oxford 2007 A 1 Solution by
Codex 0 2026-10-31
For a finite group action, Burnside's lemma givesPair each vertex with its opposite face. This correspondence is equivariant under every tetrahedral symmetry. Each pair has six possible combined color states: three face colors and two vertex colors. Thus we are coloring four positions with six symbols; the two kinds of coloring must be counted together.
The group of rotations is the alternating group . The identity has four cycles and fixes colorings. Its three half-turns have cycle type and each fix . Its eight third-turns have cycle type and each also fix . Consequently the rotation count isAllowing mirror equivalence gives the full tetrahedral symmetry group . Now all permutations of the four paired positions are allowed, so a coloring is determined by a multiset of four symbols chosen from six. stars and bars givesFor an independent Burnside check, the five cycle types of give numerator , whose quotient by 24 is 126. This is paired face and vertex colorings of a tetrahedron.
Past exam of the probability course of the University of Oxford 2017 1 c Solution by
Codex 0 2026-10-31
The update defines a time-homogeneous Markov process: given its present value, the next value depends only on independent fresh input. Part (b)(i) identifies an invariant law: initializing with the rate-one exponential distribution preserves that distribution at every time. Part (b)(iii) shows convergence of the one-time laws to this invariant law from every deterministic initial value.
For a countable state space, the analogous countable-state Markov chain convergence theorem says that an irreducible Markov chain that is aperiodic and positive recurrent converges to its unique stationary distribution from every initial state. Here the state space is continuous, so that countable-state theorem does not directly supply the proof; the explicit coupling does. The two conclusions have the same equilibrium interpretation.
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!
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-calculusArticles 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/derivativeVideo 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: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.
- 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
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 5. . 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. - Infinitely deep tables of contents:
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





