Topics (292k) Articles (302k) Users (378) Discussions (237) Comments (383) Files (8k) New article
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 207 6 c i by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 207 6 b iv by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 207 6 b iii by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 207 6 b ii by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 207 6 b i by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 207 6 a Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
With constant hazard , observation contributesWriting and , the log-likelihood is , whose derivative is . Hencethe number of events divided by total person-time.
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 207 5 c Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
Matching controls strong prognostic differences between patients and can greatly improve precision by making treatment comparisons within homogeneous pairs. It also protects against confounding when treatment assignment is not perfectly randomized globally.
Its disadvantage is loss of information: pairs with censoring before a comparison or tied outcomes contribute little or nothing, and the analysis cannot estimate the effects of pair-level matching variables. Poor matches and the logistics of paired enrollment can also reduce efficiency relative to a well-adjusted unpaired analysis.
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 207 5 b iii by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 207 5 b ii by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 207 5 b i by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 207 5 a Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
The Cox proportional-hazards model iswhere is an unspecified baseline hazard and indicates treatment. With no tied events, the Cox partial likelihood isEquality of the two hazard functions is , testable with a likelihood-ratio, score, or Wald test from this likelihood.
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 207 4 c iii by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 207 4 c ii by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 207 4 c i by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 207 4 c Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
The first two mechanisms are standard independent, noninformative censoring. The third relabels the event time itself and therefore is not independent censoring for the original latent event time; it is more naturally interpreted as assigning a cause in a competing risks model. The detailed calculations follow in the three subparts.
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 207 4 b Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 207 4 a Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
If , the inverse transform sampling formulahas survival function and hence the required exponential distribution.
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 207 3 e Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
With equal allocation and true alternative rates , the asymptotic variance isThe normal approximation requires . Hencerounded upward. Writing expresses it using a specified control rate and the target rate ratio.
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 207 3 d Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-03
Since , the rate MLE has asymptotic variance . The delta method for the logarithm givesIndependence of the arms therefore yieldsUnder , the asymptotic variance of the log rate ratio is
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 207 3 c Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
Targeting the Neyman ratio asymptotically minimizes the standard error for a fixed total sample size, so it cannot be worse than a fixed 1:1 design when the target probabilities are known. Targeting the ethical ratio can increase the standard error because it optimizes failures rather than information, although it may still outperform 1:1 for some probabilities.
In response-adaptive randomization, the probabilities are estimated during the trial. Delayed outcomes, time trends, unstable early estimates, and random final arm sizes complicate logistics and inference; naive Wald standard errors may also ignore adaptation.
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





