Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 35 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Both factors are assigned at orchard level. Therefore the experimental units are the twelve orchards; the trees are observational units within them. The six combinations form a balanced factorial design, replicated twice. The orchard ANOVA stratum has statistical degrees of freedom. Spray uses , pruning uses , and their interaction term uses , leaving six for error.
Dividing each treatment sum of squares in ANOVA by its statistical degrees of freedom and using as the denominator gives all missing entries:
The unrounded F-test statistics are , and . The within-orchard tree mean square in ANOVA, 180, is not the treatment error denominator: using it would confuse subsampling with independent replication. The tree ANOVA stratum has statistical degrees of freedom; is the uncorrected total, and the corrected total is 359.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 35 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
First agree the scientific question and primary response variable. Ask the vet about the disease's course, the proposed mechanism and duration of each treatment, the eligible population, baseline severity, and what outcome and follow-up time would represent worthwhile improvement. Is the disease transmissible, is recovery reversible, and can treating one cow affect another's outcome? These answers determine whether a crossover design is credible, whether the experimental unit should be a cow or a whole herd, and whether individual randomization would leave interference between groups. Agree welfare and rescue arrangements with the vet when deciding which comparisons are feasible; the statistical plan cannot determine these from an unfamiliar disease name.
Second agree feasible allocation and adequate independent replication. Discuss numbers of available cows and herds, variation in the chosen outcome, a scientifically meaningful treatment difference, and the desired statistical power. Use these to plan sample size, rather than choosing a number solely from convenience. Discuss herd, lactation stage and initial severity as potential blocks in experimental design, then specify randomization, comparable management, concealed allocation and blinded outcome assessment where feasible. Repeated milk or health records from the same cow are observational units, not extra independent experimental units; pseudoreplication would give misleading standard errors. Availability of enough independent cows or herds, together with expected variation, governs the precision actually achievable.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 35 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
A completely randomized design uses eligible animals, randomly selecting to receive and assigning the remainder to . Use comparable follow-up and assess the same response variable in both groups. Its advantage is simplicity and freedom from previous-treatment carryover effects; its disadvantage is that between-animal variation enters the residual and can make a treatment contrast imprecise.
A randomized complete block design with matched pairs first forms pairs using pre-treatment characteristics such as initial disease severity, age or breed. Independently choose which animal in each pair receives , with its partner receiving . The experimental units are animals; pairs are blocks. The average within-pair difference estimates the treatment contrast, and positive within-pair similarity can reduce its variance. Its advantage is control of known heterogeneity; its disadvantage is the need for useful matching, with fewer residual statistical degrees of freedom and little gain if the matching variables are uninformative. Do not construct pairs using outcomes observed after assignment.
A two-period crossover design randomly assigns half the animals to sequence and half to . Each animal receives both treatments in separate periods, with a scientifically justified interval between them and the same outcome assessment after each period. Animal blocks remove persistent between-animal differences, while the two sequences balance treatment against period. Its advantage is potentially high precision from within-animal comparisons; its disadvantage is vulnerability to carryover effects, changing disease state and irreversible effects. It is suitable only when comparing the treatments in both periods remains meaningful and residual effects of the first treatment are adequately controlled. A two-period crossover design does not by itself disentangle arbitrary treatment-specific carryover effects.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 35 2 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Consider learning and memory of the maps. Repeating an identical map can improve later scores through recall rather than the assigned program, and a skill learned using one program can transfer to another. Provide comparable familiarization before recording responses and use new, difficulty-matched maps on later afternoons. If all volunteers face the same map on a given afternoon, common map difficulty is absorbed by the afternoon block.
The balanced transitions in the proposed row-column design help with first-order carryover effects, but general practice, higher-order memory and program-dependent learning may still require an explicit interaction term or carryover effect in the analysis. Merely applying randomization to treatment labels cannot make these effects disappear.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 35 2 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Start with six program sequences: , , , , and . This gives two appearances of each program per row and per column. It also balances transitions: each ordered pair of distinct programs occurs five times across all adjacent sessions.
Apply restricted randomization by randomly assigning the six sequences to the six volunteers and independently permuting the three program labels. Using the supplied numbers, rank the first six from smallest to largest: the sequence indices are . Assign these, in order, to volunteers 1 through 6. Rank the next three numbers attached to symbols : their order is . Assign actual program labels to these ordered symbols, so base , base , base . The final ready-to-use randomized row-column design is:
Programs retain their real identities after this label permutation. The researcher should follow the table across chronological afternoons; arbitrary column permutations are deliberately excluded so that transition balance survives. Each program receives twelve sessions and occurs twice in every block. Under the additive block model, the analysis of variance has row, column, program and residual statistical degrees of freedom , respectively, besides the grand mean. Transition balance is useful against differential carryover effects, but is not a proof that they are absent.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 35 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Use two crossed sets of blocks in experimental design: volunteers as rows and afternoons as columns. Volunteer blocks control persistent ability, drawing style and prior experience; afternoon blocks control conditions shared that day, including common task difficulty and general practice over time. Neither partition is nested in the other.
Give every volunteer each program twice, and use each program twice each afternoon. The row-column design is then balanced for both block systems. In the additive modelthe program contrasts are orthogonal to both centered block spaces. This controls additive volunteer and afternoon effects; it does not automatically eliminate individual learning differences or carryover effects.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 35 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The experimental unit is a volunteer on a particular afternoon, since that volunteer-session receives a program assignment. There are 36 such experimental units; a volunteer is a repeated block, rather than a unit that receives only one program throughout the experiment.
The observational unit is the individual completed sketch, equivalently the session's single recorded count of correctly represented features. The separate map features contribute to that response variable; they are not independently randomized replicates. Nor are repeated sessions on one volunteer independent subjects.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 35 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
An orthogonal block design has treatment contrasts orthogonal to block contrasts after removing the grand mean. This is a statement about vectors on the experimental units, with the usual inner product; the two full spaces are not orthogonal because both contain the constant vector.
For a counting criterion, let count experimental units receiving treatment in block , let , let , and let . The inner product of the centered indicators for treatment and block is . ConsequentlyIn particular, equal-sized blocks must contain each treatment in the same proportion. Under an additive block-and-treatment model, adjustment for blocks then does not change the fitted treatment contrasts.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 35 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Write , let be the identity matrix, let be the -by- all-ones matrix, and put , with one diagonal block per experimental block. The variance-covariance matrix isIts orthogonal decomposition is obtained by first subtracting each block's sample mean, then subtracting the grand sample mean from the block means. More explicitly, writing for coordinate in block , the three invariant subspaces areThey are pairwise orthogonal, with dimensions , and , and their direct sum is . On , both and vanish. On , and . On , and . Thus the eigenvalues and corresponding invariant subspaces areIf some eigenvalues coincide, their eigenspace is the direct sum of the listed subspaces with that value. Zero-dimensional rows are omitted when or . For an admissible covariance matrix the eigenvalues on nonzero subspaces must be nonnegative; these conditions are also sufficient for positive semidefiniteness. The expectation parameters do not affect this calculation.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 34 4 f Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Integrate each supplied predictive density to get its cumulative distribution function , then form the sequential probability integral transformFor a correct continuous one-step conditional predictive model, . Iterating this identity shows that the are independent uniform variables. A histogram or quantile plot checks uniformity; serial plots and autocorrelations check for temporal structure left unexplained by the forecasts.
Also inspect empirical coverage of central prediction intervals, tail exceedances and interval widths, assessing calibration together with sharpness. These checks need only the supplied forecasts and observations. Compare chosen predictive discrepancy statistics with simulated uniform reference sequences. A total log score alone is a relative reward and does not provide a universal absolute goodness-of-fit threshold.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 34 4 e Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let be one fixed model indicator with equal prior probabilities, and put . Within each model the parameters are already updated using the same past data. The Bayesian model averaging forecast is . Upon observing , Bayes' theorem givesTaking the ratio cancels the denominator and gives the prescribed update because . Iteration yieldsThe weights are posterior model probabilities and their mixture is the full Bayesian predictive density. The indicator is fixed across days, rather than choosing a fresh model independently each morning.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 34 4 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Model gives the sequential forecast . The probability chain rule yieldsApplication of Bayes' theorem makes the factors successive posterior predictive distributions, and their product is the Bayesian model evidence. Under conditionally independent sampling it isTaking logarithms gives the prequential log score identityTherefore the Bayes factor isThis solves the second half of part (d), which is missing from the TeX. Proper priors and finite positive evidences are needed; unrelated improper-prior normalizing constants do not cancel.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 34 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Let be the true density and the announced density. The advantage of truthful reporting for the logarithmic scoring rule isThe Kullback-Leibler divergence is nonnegative, with equality exactly when the densities agree almost everywhere. For instance, Jensen inequality gives ; equality requires a constant likelihood ratio on the true support and no remaining mass outside it. ConsequentlyThis proves strict propriety when the expected log scores are well defined, for example with a finite true expected log density. A forecast assigning zero density to a set of positive true probability has score there and cannot outperform the truth. The hint's strict must be corrected to to allow its equality case.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 34 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Let be the genuine rain probability and the reported probability. The linear probability score has expected rewardThis is linear in , so its optimal report and expected reward areAt every report scores on average. Truthful reporting scores , strictly below the optimum for interior . Thus the rule is not proper: it rewards maximal confidence in the more likely outcome. The expected total over days is .
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 34 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
A scoring rule in the reward convention gives for announcing the probability distribution and then observing . Under genuine belief , the expected score isA proper scoring rule satisfies for every admissible . A strictly proper scoring rule additionally requires equality only when the distributions coincide:The expected scores must be well defined. A loss convention reverses the inequalities, but the question uses rewards.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 34 3 e Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The first coefficient is the posterior mean log odds of choosing invertebrates rather than fish for smaller alligators at Lake Hancock. It corresponds tofor those invertebrate-to-fish odds. This is not the absolute probability of choosing the second category, because the other categories also enter the normalization.
The size coefficient adds to the invertebrate-to-fish log odds on changing to the larger class, holding lake fixed. Its common-across-lakes odds ratio isabout a 78 percent reduction in the relative odds. Exponentiating a posterior mean log odds is a geometric summary, not the arithmetic posterior mean of the odds.
There are free category coefficients plus group intercepts, giving 28 free parameters in the fitted Poisson model. The effective parameter count in DIC, , is close to 28 and slightly smaller, consistent with some regularization or incomplete information. Comparing it with 20 would omit the nuisance intercepts. A direct conditional multinomial fit has 20 coefficients but a different observational likelihood, since it conditions on the totals.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 34 3 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The Poisson trick introduces . With an exactly flat log-rate prior, the baseline prior measure is . For ,Thus flat log-rate marginalization gives the multinomial likelihood:Alternatively, independent Poisson counts conditional on their total are exactly multinomial distributions with probabilities . Locally uniform coefficient priors make the coefficient posterior proportional to this likelihood within their flat region.
The printed BUGS prior is a proper normal distribution on , with variance , since BUGS uses precision as its second argument. It is broad but not exactly flat. Substitution shows that, apart from a coefficient-independent constant, the integrated likelihood is the multinomial kernel times the Gaussian log-rate correction to the Poisson trickIt depends on the coefficients through . Dominated convergence gives as , so the finite-variance code yields an approximation to the multinomial posterior, not exact equality. Large log rates can make prior sensitivity relevant.
The cell-wise factors form a standard Poisson regression, convenient for BUGS. They avoid an explicitly constrained count vector and permit scalar log-concave updates for intercepts and coefficients; an exactly flat-log-rate implementation also gives gamma conditional baseline rates. This can be computationally efficient, although the actual log-normal baseline prior is not gamma-conjugate and introduces nuisance intercepts. Efficiency depends on the update scheme.
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





