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 2007 iii Paper 48 5 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write and . Use shape-rate notation for the Gamma distribution, as in the authoritative PDF: shape and rate give a density proportional to . Conditional independence of the Poisson distributions gives a likelihood function proportional toThe product of factorial terms depends only on the data and can be absorbed into the normalizing constant. Multiplying by the two independent Gamma distribution prior kernels and the uniform prior on the possible indices gives the Poisson count change-point model with gamma priors:Because the hyperparameters are positive, each possible index gives finite positive gamma integrals, and summing over the finitely many indices yields a proper posterior distribution. At the second likelihood factor is one, so the posterior law of its unused rate remains its prior .
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 47 4 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For every binary vector , , and henceThus is not a metric, because it fails identity of indiscernibles. It is nonnegative and symmetric. In fact it also satisfies the triangle inequality trivially: every value lies in , so . That does not repair its nonzero self-distance.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 47 4 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For fixed , the complement of the simple matching coefficient is the fraction of coordinates that disagree:This is the normalized Hamming distance. It is nonnegative, symmetric, and is zero exactly when every coordinate agrees. At each coordinate,Summing and dividing by proves the triangle inequality. Therefore is a metric on the binary vectors.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 47 3 c ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The three retained covariance components explainleaving only of the raw total variance. Three components are a reasonable covariance-based descriptive compression, if that amount of discarded variation is acceptable for the intended use. Even two explain about , so three is a useful choice rather than a uniquely forced one.
For the correlation analysis,so three retain and discard of standardized variation. Three can provide an interpretable summary, but the supplied information does not justify treating them as sufficient for every purpose. Tasks requiring high standardized reconstruction accuracy may need more.
Each of the three displayed correlation eigenvalues exceeds the average eigenvalue one, but that alone does not show all remaining eigenvalues are below one. Their sum is , and a fourth eigenvalue just above one is compatible with both that sum and the ordering. A complete eigenvalue sequence, a plot of successive eigenvalues, and the stability and interpretation of the directions would help decide the cutoff. With only 25 countries, estimated directions also have sampling uncertainty. The retained covariance and correlation dimensions should therefore be judged against their own variance criterion and substantive aim, not chosen solely because three columns were printed.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 47 3 c i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Covariance-based PCA uses centered protein measurements in their original gram units. Its total variance is . Correlation-based PCA first divides each centered food measurement by its sample standard deviation, giving nine unit-variance variables and total variance nine. Thus it is principal component analysis on a correlation matrix, not an equivalent rotation of the original unscaled measurements.
The variances of cereals and milk together account for of the original total. Consequently those variables have considerable influence on covariance-based PCA. Its first component is dominated by a cereal coefficient opposed to milk , broadly a cereal-versus-milk contrast. Its second is dominated by milk , with cereals and fish . Its third is chiefly white meat versus fish , with a smaller negative milk term. Component signs may all be reversed without changing the analysis; the important features are relative signs and magnitudes.
After standardization, eggs and starch can contribute as strongly as large-variance foods. The first correlation-based component gives positive weight to meat, eggs, milk and starch, opposed principally to cereals and pulses/nuts; eggs now has coefficient despite its small raw variance. The second emphasizes fish and fruit/vegetables negatively, opposed especially to starch and white meat. The third contrasts white meat and fruit/vegetables with milk, fish and red meat. Thus standardization changes both the emphasis and the directions, rather than just the displayed units of the same components.
The explained variance of a principal component must use the appropriate total:Raw and standardized percentages describe different variance objectives and must not be compared as if one method were always superior.
Standardize when relative patterns across variables, rather than their absolute gram-scale variation, should have equal marginal weight. Correlation-based PCA is also insensitive to changing a variable's measurement unit, which covariance-based PCA is not. Here every food group already has the same units, so differing units do not force standardization. If large fluctuations in actual protein amounts are scientifically important, covariance-based PCA is appropriate. If dietary composition across all food groups is the focus, correlation-based PCA can be more informative. Standardization can nevertheless amplify noise in nearly constant variables; the decision should follow the scientific purpose and measurement reliability.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 47 2 b iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
With zero cost for correct assignments, the total expected misclassification cost isThe part depending on is the integral of . Therefore the cost-sensitive Bayes classifier isFor positive costs and weighted densities, the log posterior-odds score from part (ii) now has threshold . Larger cost of sending class one to class two expands the region assigned to class one. The weighted-density comparison also handles zero costs without taking an undefined logarithm.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 47 2 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Apply the minimum-integral decision region principle to . The optimal Bayes classifier chooses class one when , and class two for the reverse inequality. Ties can be assigned either way. An everywhere valid discriminant score isWhere both weighted densities are positive one may equivalently use and threshold zero. This chooses the largest posterior class probability, because both posterior probabilities have the same positive mixture-density denominator.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 47 2 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
There are two disjoint ways to make an error: an individual from class one falls outside , or an individual from class two falls inside . The law of total probability givesSince integrates to one, this also equalsThis form isolates the only term changed by choosing the decision region.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 41 1 a i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Suppose lies on the relative boundary of in its span . There is a nonzero with for every and . Here is a direct construction of the supporting vector. Choose points converging to , let be their nearest points in , and set . The minimization inequality for a nearest point gives on and . A subsequence of the unit vectors converges to a unit vector . Since , it has the asserted support properties.
The test-weight characterization of now gives almost surely. This random payoff cannot vanish almost surely: otherwise would annihilate every element of , hence all of , contradicting and . ThereforeThis supplies the positive-terminal-payoff alternative. If has zero-dimensional span, its relative boundary is empty, so that case requires no supporting vector.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 33 6 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Refining an occupied cell replaces it by two child cells, at least one of which is occupied. All children of a cell contained in remain contained in , and additional cells can enter the sum. Hence is nondecreasing, pathwise, and is at most .
We must also address boundary points for a fixed interval . For every fixed deterministic , take bounded intervals containing with lengths tending to zero. The assumed void law givesThus the fixed endpoints of are almost surely not atoms. This is the exponential void probabilities forbid fixed atoms observation; it is not a simultaneous assertion for all possible real endpoints.
In a fixed bounded interval containing , local finiteness gives only finitely many atoms. Simplicity makes their locations distinct, so there is a positive minimum distance between any two, unless there is at most one. Every atom in the interior of also has positive distance from its endpoints. For sufficiently fine dyadic cells each such atom lies alone in a cell fully contained in , including if the atom itself is at a dyadic boundary because the cells are half-open. Thus the dyadic occupancy approximation of a simple point measure eventually equals , almost surely. In particular,
The union of fully contained level- cells misses at most two boundary portions of total length at most . Consequently , and . For , the probability generating function from the binomial calculation givesThe convergence follows by expanding the logarithm, since and . Since the counts converge almost surely, bounded convergence identifies the same expression as . It is the generating function of the Poisson distribution, whose power-series coefficients determine its law. Thus
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 33 6 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
At level , the dyadic cells fully contained in are disjoint. Their occupied indicators are independent by the preceding part, and every cell has length , so each has success probabilityTheir sum therefore satisfiesIf there are no fully contained cells, and this means the deterministic zero count. The binomial law follows directly from independence of occupation indicators, without assuming that the full counts are already Poisson.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 33 1 c iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The event belongs to . Its -measure can therefore be computed using the finite-level density:Let . Because the chosen versions satisfy everywhere, every point of eventually lies in all the . For each , the set has -measure at most ; these sets increase as increases. Continuity from below givesLetting yields . In contrast, the preceding part says . Thus is concentrated on the -null set . This proves that and are mutually singular measures, and completes the martingale construction of Lebesgue decomposition:The key step is that the density identity is available on each even though need not have a density on the full Borel sigma-algebra.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 33 1 c ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Put . It is a conditional-expectation martingale. We justify why its limit is , rather than just quoting convergence to an unspecified random variable.
First the family is uniformly integrable. For , nonnegativity and the conditional expectation identity giveThus its tail expectations are at most twice the integrable tail of , uniformly in . The uniformly integrable martingale convergence theorem gives a limit almost surely and in . For any and ,Pass to the limit and extend from to all Borel sets by the Monotone class theorem. The equality of these integrals forces almost surely. Combining this with the preceding convergence of proves
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 33 1 c i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write . This is a finite positive measure. For , the conditional expectation inequality givesThe union is an algebra of sets generating , since half-open dyadic intervals generate all open sets and hence all Borel sets. The class is closed under increasing and decreasing limits, by continuity of these finite measures. The Monotone class theorem extends the inequality from to every Borel set. Approximation by nonnegative simple functions and monotone convergence then giveThe difference is therefore a finite nonnegative measure, not merely a signed measure. For ,Consequently its restricted Radon-Nikodym derivative isChoose the cell-average versions of all the conditional expectations. Then is constant on each level- cell and equals there, so these versions are nonnegative at every point.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 29 6 c iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
First suppose is a cusp form. Choose finitely many representatives for ; their translates of the standard modular region cover a fundamental region for . On the compact truncated part of each translate, the continuous function is bounded. On its tail, the corresponding modular cusp expansion of has zero constant term, so uniformly in the real part. Therefore is bounded there and tends to zero. Part (b) identifies this expression with . There are only finitely many representatives; taking the maximum of these bounds and using -invariance proves that is bounded on all of .
Conversely assume all three conditions and . Items (i) and (ii) show that at each modular cusp a holomorphic periodic translate satisfies . In its punctured-disk coordinate,The Riemann removable singularity theorem extends holomorphically to zero with . Equivalently its Laurent expansion has no negative powers and no constant term. Since this holds at every modular cusp, is a cusp form. Hence the three conditions are sufficient as well as necessary in positive weight, with the weight-zero exception explained in the root solution.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 29 6 c ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The transformation condition is necessary by the definition of a cusp form. For sufficiency, fix representing any modular cusp, and set . By item (i), is holomorphic in the upper half-plane. Choose an actual period with . Associativity of slash operations and the given transformation law giveThus and is a single-valued holomorphic function on a punctured disk with coordinate . The calculation in part (b) transports the original uniform bound to this translate:This puts every modular cusp in exactly the situation needed in item (iii). No assumption that a single modular cusp represents all of 's modular cusps is made.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 29 6 c i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A cusp form is holomorphic in the upper half-plane by definition, so it is meromorphic there. In the reverse direction suppose is meromorphic andOn a small closed disk around an interior point, is bounded above and away from zero. Hence is bounded there by a fixed constant. A pole of positive order would make unbounded along points approaching its center, a contradiction. Every possible pole is therefore removable, and is holomorphic on . Meromorphicity alone would not establish this conclusion; the bounded invariant norm is being used here.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 82 4 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Put . For the Fay solution, . At the first harmonic therefore giveswhich agrees with the late-time limit in (i).
For the opposite limit, expand the reciprocal hyperbolic sine as a geometric series and interchange absolutely convergent sums at every :This exact positive-denominator form is useful near the shock. For small and , expand the denominator of the terms with small and use . The leading sum isFor the shock-layer scaling , the passage to this sum follows from dominated convergence: and for small provide a summable bound proportional to . The same leading expression matches the outer small-angle range . More generally, split the exact sum at with : the low terms have vanishing relative Taylor error, while the discarded exact and approximate tails are smaller than the leading expression by .
Now apply the partial-fraction identity for the hyperbolic tangent with :The Fay shock-layer asymptotics are thereforeThe angular shock thickness is , and its matched states are . At , both formulas vanish; the limiting slopes agree. The denominator throughout this derivation is as printed in the PDF, not the erroneous in the converted TeX.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 82 4 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For this sign of the viscous Burgers equation, the Cole-Hopf transformation is . Integrating the initial sinusoid gives ; the positive multiplicative constant cancels from . Set and . The Fourier series of the initial exponential and the heat equation yield the exact sinusoidal Cole-Hopf solution for negative-flux Burgers flow:Each harmonic decays by its heat multiplier, which can also be obtained directly by convolving it with the Gaussian heat-kernel convolution. At the first harmonic dominates:The error bounds use for real positive , also immediate from the Fourier-integral representation. Dividing, including the correction from the denominator, givesFor , the large-argument asymptotic expansion of a modified Bessel function gives . HenceThe sign is positive because the first Fourier harmonic of is negative, so its angular derivative is positive. For a fixed nonzero , the relative corrections vanish as and ; at the symmetry points both the exact solution and the leading expression vanish.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 82 3 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let , , and . At the next order of the WKB approximation, the transverse operator givesThe moving-wall Neumann boundary condition gives and . Multiply by and integrate across the duct. Since and at both walls, integration by parts givesAlso , because at both walls. Substituting these identities in the next-order equation produces the transport equation for the variable-sound-speed WKB duct amplitude:Consequently is a complex constant, including a constant phase. For , ; for , , with the factor two absorbed into the mode's arbitrary constant. ThusEquivalently,There is an independent flux check. The real-coefficient Helmholtz equation implies , and the wall condition gives zero normal flux. Hence the integrated longitudinal current is constant; at leading order it is . This agrees with the transport equation. The factor must be retained: using only would ignore the variable coefficient in the given divergence-form equation.
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





