Topics (282k) Articles (291k) Users (352) Discussions (237) Comments (383) Files (6k) New article
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 4 34B a Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 4 33B b Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
Move to a rotating frame. With detuning (changing sign with the phase convention), the constant two-level Hamiltonian has generalized Rabi frequency . Starting in state zero,The transition envelope is maximized on resonance, , namely for the matrix phases printed in the question.
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 4 33B a Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
First-order time-dependent perturbation theory givesThe lowest nontrivial transition probability is , with errors of higher order in .
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 4 32A c ii by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 4 32A c i by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 4 32A b Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 4 32A a Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
Order a period-three orbit as . Its images produce two subintervals with covering relations and . Any closed walk in this directed graph gives, by the interval-covering lemma and the intermediate value theorem, a fixed point of the corresponding iterate. Primitive closed walks of every length exist, giving an orbit of every positive period; this is the period-three case of Sharkovsky theorem.
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 4 31A d Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 4 31A c Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 4 31A b Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 4 31A a Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
After setting , the transformed coefficients have a singularity beyond the regular-singular growth bounds at . Thus infinity is an irregular singular point.
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 4 2H c Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
On the simplex define . Strict positivity makes the denominator positive and maps the simplex continuously into its interior. By Brouwer fixed-point theorem, for some . Thus , where , and because is strictly positive, so is .
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 4 2H b Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
The equivalent no-retraction theorem says there is no continuous retraction of the closed disk onto its boundary circle. A fixed-point-free map gives a retraction by projecting from through to the boundary; conversely a retraction composed with the antipodal boundary map gives a fixed-point-free self-map.
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 4 2H a Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
The Brouwer fixed-point theorem says that every continuous map from a closed two-dimensional disk to itself has a fixed point.
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 4 29K d Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
Apply Cameron-Martin theorem to the absolutely continuous path up to and thereafter. Its derivative is on and zero later, so the Radon-Nikodym factor is , yielding the formula for every bounded measurable functional of the path after .
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 4 29K c Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 4 29K b Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 4 29K a Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
A Brownian motion starts at zero, has continuous paths, and has independent increments with . The stated covariance makes every finite collection jointly Gaussian; disjoint increments have zero covariance and hence are independent. Their variances are interval lengths, proving all defining properties.
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 4 28J d Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
Neither proper gamma prior yields the condition in part (c). The risk in part (a) is unbounded as because . The risk in part (b) is analytic, tends to zero at infinity, and is not identically zero, so its prior average is strictly below its supremum for a gamma prior with positive density everywhere. Thus this sufficient condition proves neither estimator minimax for any .
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 4 28J c Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
An admissible Bayes estimator whose Bayes risk equals its maximum risk is minimax. Indeed every estimator has maximum risk at least its prior-average risk, which is at least the Bayes risk; equality for the stated estimator attains this lower bound. Admissibility excludes a distinct estimator improving it everywhere.
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





