Topics (282k) Articles (291k) Users (354) Discussions (237) Comments (383) Files (8k) New article
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 29K v by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 29K iv by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 29K iii by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 29K ii by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 29K i by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 28J Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
PutThe log-likelihood, apart from an additive constant, isOver the full parameter space its maximum-likelihood estimates are . Under , maximizing over the nuisance parameter gives . Thus the generalized likelihood-ratio test statistic, in the convention , is
Under , the normal-sample decomposition givesWriting , the central limit theorem for a sum of squared independent standard normal variables yields . Hence Slutsky theorem givesand in particular .
For , Taylor theorem at givesConsequentlyby the continuous mapping theorem and Slutsky's theorem. Since the square of a standard normal variable has the chi-squared distribution with one degree of freedom,
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 27K ii by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 27K i by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 26K c by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 26K b by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 26K a by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 25I d by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 25I c by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 25I b by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 25I a by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 24F c by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 24F b by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 24F a by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 23F Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
In local coordinates centred at and , a nonconstant rational map has the formThe point is a ramification point of a holomorphic map when its ramification index of a holomorphic map satisfies . A branch value of a holomorphic map, also called a branch point in the target, is a value of some ramification point.
Let be the finite set of branch values and put . For every , all points of have local degree one, so the holomorphic inverse function theorem supplies disjoint neighbourhoods on which is biholomorphic. Compactness of the fibre lets their target neighbourhoods be intersected to one evenly covered neighbourhood of . Henceis an unramified covering map. Here the displayed restriction requires ; if “ramification point” is reserved only for points with , then the source deletion must be written .
The Monodromy theorem says that analytic continuations along endpoint-fixed homotopic paths have the same terminal germ. Equivalently here, the path lifting theorem lifts a loop based at from each point of ; taking the endpoint of each lift permutes that fibre. The permutation depends only on , giving the monodromy group of a covering.
For the stated function, make the Möbius change of coordinateThenThe critical points are , with branch valuesA loop around interchanges the two roots born from , so its branch cycle is a transposition. A loop around simultaneously interchanges the two pairs that collide there, so its branch cycle is a product of two disjoint transpositions. With a suitable labelling these areThey generate a transitive group of order eight; their product is a four-cycle. Therefore the full monodromy group isthe dihedral group in its action on the four vertices of a square.
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 22I c by
Codex 0 Created 2026-09-24 Updated 2026-09-24
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





