Topics (282k) Articles (291k) Users (353) Discussions (237) Comments (383) Files (6k) New article
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 3 30D 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 3 2H Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-03
The polynomial Runge theorem says that if is compact, is connected, and is holomorphic on a neighbourhood of , then for every there is a polynomial such that .
For an explicit approximation on the left semicircle , defineThe two power-series expansionsproduce this formula. The first is a geometric series whose ratio has modulus at most on . The second converges uniformly on the whole unit circle; the elementary bound shows that truncating it at gives a total error tending to zero even after summing over . Consequently uniformly on . This is an explicit polynomial approximation of the reciprocal on the left semicircle.
No such sequence exists on the punctured unit circle . If polynomials converged uniformly there, they would be Uniformly Cauchy. Continuity givesso they would converge uniformly on the entire unit circle. The uniform limit theorem would force the value at the missing point to be , and hence the limit would be on the full circle. But the Cauchy integral theorem gives for every , while uniform convergence and contour integration would implya contradiction. This is the polynomial approximation obstruction on a punctured circle.
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 3 29K 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 3 29K 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 3 28J 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 3 28J 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 3 27K Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
A renewal-reward process consists of i.i.d. regenerative cycles , where is the th cycle length and is the reward accumulated during that cycle. If and , the renewal-reward theorem states that the cumulative reward satisfiesalmost surely, with the usual negligible-remainder condition for an unfinished cycle.
For the machine, let be its working lifetime after a repair. The next repair occurs at the first inspection following failure, so one repair-to-repair cycle has lengthwhile its working-time reward is . Since an exponential distribution of rate has mean ,By the tail-sum formula for the positive integer-valued variable ,Thereforeand the long-run proportion of time for which the machine is working is
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 3 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 3 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 3 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 3 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 3 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 3 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 3 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 3 24F 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 3 24F 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 3 24F 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 3 24F 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 3 23F Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
For the period lattice , define the Weierstrass elliptic function byTo prove Normal convergence of the Weierstrass elliptic-function series, let be compact and choose with on . For ,The comparison series converges by the stated lattice-sum criterion. The Weierstrass M-test gives uniform convergence on ; since was arbitrary, the series converges locally uniformly away from . The locally uniform convergence of holomorphic functions makes its sum holomorphic there, and the displayed principal term gives a double pole at every lattice point.
The function is even and satisfiesThe three nonzero two-torsion points are distinct modulo and each equals its own negative modulo . Therefore no two can have the same -value, so are distinct. Equivalently, is a degree-two branched map and each half-lattice point already occupies its fiber with multiplicity two.
For a transitive example, take the equianharmonic latticeand define . Multiplication by preserves , so is a conformal equivalence. On the nonzero half-lattice points it acts bybecause . Thus it acts transitively.
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 3 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





