Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 1 1G i Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 1 19F ii Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 1 19F i Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 1 18H iii Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 1 18H ii Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 1 18H i Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 1 17F b Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 1 17F a Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 1 16G Solution Created 2026-09-24 Updated 2026-10-14
Work with well-ordered cardinals, as usual with the axiom of choice. We first prove the infinite cardinal arithmetic identity . If a least infinite counterexample existed, order pairs of ordinals below first by their maximum coordinate, then lexicographically within each level. Every initial segment ending at lies inside . Its cardinal is less than , by the smaller-cardinal identity or finite counting. This well-order cannot have an element with predecessors, so its order type is at most the initial ordinal . Thus , contrary to its being a counterexample; the reverse injection is . HenceA sum of finitely many finite cardinals is finite, so is regular. A sum of fewer than smaller cardinals is a countable union of countable sets and has size at most , so is regular.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 1 15D Solution Created 2026-09-24 Updated 2026-10-14
Let the stellar radius be and assume zero external surface pressure. A spherical shell has mass and contributes to the gravitational potential energy. Using hydrostatic pressure support,The center boundary term vanishes and eliminates the outer term. Nonzero external pressure would add .
The total energy is , so energetic gravitational binding requires . For an isotropic gas, kinetic theory gives . Nonrelativistic kinetic energy is , giving and . Ultrarelativistic energy is , giving and : the ultrarelativistic limit is marginal in this Newtonian virial balance.
For a white dwarf, electron degeneracy pressure becomes ultrarelativistic as density increases. Its equation of state then scales as . Pressure support and gravitational stress have the same radius scaling, leaving a limiting mass of order rather than allowing arbitrary mass to be supported by contraction. The Chandrasekhar limit is this maximum mass for a cold electron-degenerate star at specified composition, of order .
The virial calculation by itself does not establish a universal numerical maximum mass for every stellar composition and equation of state; its precise consequence is loss of binding/support as the pressure-bearing particles become ultrarelativistic. An accreting carbon-oxygen white dwarf approaching its limiting mass typically undergoes runaway carbon burning and thermonuclear disruption, a Type Ia supernova. For other compositions or evolution, electron captures can instead lead to collapse into a neutron star. The subsequent evolution needs that physical distinction.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 1 14E iv Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 1 14E iii Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 1 14E ii Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 1 14E i Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 1 13J Solution Created 2026-09-24 Updated 2026-10-14
Let denote the maximized log-likelihood in the saturated model, with one fitted mean per observation. With known dispersion, define the deviance of a fitted model as ; for an exponential-dispersion convention that scales deviance by the dispersion , divide that scaled quantity by in the following test.
Let be the fitted deviances under the null and full models. Their difference is the likelihood-ratio test statisticUnder the regular identifiable interior null hypothesis, Wilks theorem gives the limiting distribution. Reject for an observed difference above its chosen upper-tail critical value. This concerns the difference of fitted model deviances, not simply the full-model deviance compared with zero.
For a Poisson regression, the means are and . Saturation sets , taking the limiting value at . Consequently the Poisson deviance iswith . The intercept score implies at a finite fit, although retaining that term makes the individual deviance contributions clear.
For with small, expand . The linear term cancels and the result is . Thereforethe Pearson chi-squared statistic. The approximation requires adequately large fitted counts and small relative residuals; it is not an identity for sparse observations.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 1 12H Solution Created 2026-09-24 Updated 2026-10-14
A binary symmetric channel flips each transmitted bit independently with probability . A length- channel code specifies input words and a decoding rule; its rate is , and its error probability is the probability of a wrongly decoded message. The channel capacity is the supremum of asymptotically achievable rates with vanishing error. For , put , with . The Shannon second coding theorem here statesWe prove achievability and the converse rather than using the formula as a substitute for a coding argument. Output complementation reduces to , so first assume .
Fix . Choose such that and . Independently choose uniformly random input words. Decode a received word to the unique codeword within Hamming distance , declaring error if there is none or more than one. The weak law of large numbers says the empirical fraction of independent Bernoulli- errors tends in probability to , so exceeding this distance has probability tending to zero.
For any independently chosen competing codeword, its probability of lying in this ball is , whereIndeed follows by bounding the probability of exactly successes in a binomial experiment with parameter by one, and increases on . A union bound therefore bounds the ensemble-average decoding error bySome deterministic code is at least as good as this average. Expurgating the half of messages with greatest individual error makes the maximum message error at most twice the original average, and changes the rate by at most . This proves achievability even for maximum-error probability.
For the converse, take uniform messages and any deterministic code/decoder. The independent noise word has probability . Its normalized negative log-probability tends in probability to by the same law. Thus, outside an event of probability tending to zero, each noise word has probability at most . The decoder's disjoint decision regions contain at most received words in total. HenceAt rates bounded above capacity by a positive amount, choose smaller and obtain success probability tending to zero. This establishes the strong converse as well as the ordinary impossibility of reliable transmission above .
When the output is independent of the input, so success probability for uniform messages is at most and . At or the channel is noiseless or deterministically inverted; all words can be distinguished, so . These endpoints complete the theorem.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 1 11F Solution Created 2026-09-24 Updated 2026-10-14
Inversion in a circle of center and radius is on the extended plane. It sends infinity to , so it interchanges zero and infinity exactly when .
For the unit-circle inversion , both and are involutions. If , applying gives . Writing , we have and , and therefore . This proves both assertions about the fixed points.
We now show that one fixed point is inside the disk and use it as the hyperbolic center. Rotate coordinates to make the Euclidean center . The hypothesis is . If the conclusion follows immediately from the radial hyperbolic distance. If , thenfor its fixed points. Since , this quadratic has two positive roots with product one, one and the other .
The disk automorphism is a Poincare disc automorphism. It sends the two fixed points to zero and infinity and commutes with on the extended plane. Consequently interchanges zero and infinity. Conjugation takes circle inversion to inversion in the image circle, so the first part says that is centered at zero. Its Euclidean radius is some .
In the Poincaré disk metric, integrating the radial length element givesSince preserves distance, the original circle is exactlyUndoing the preliminary rotation gives the center for arbitrary complex .
This identifies the hyperbolic circle in the Poincare disc intrinsically.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 1 10D Solution Created 2026-09-24 Updated 2026-10-14
The Hubble time is the instantaneous inverse expansion rate , where . A radial light ray covers comoving distance . Since , the present proper radius of the particle horizon isFor the power-law scale factor, requires . The integral converges only when , in which caseAt the divergence is logarithmic, and at it is a power divergence. The familiar flat-universe epochs have for radiation and for pressureless matter, obtained from or and the Friedmann equation. Both have , so their ages are less than the present Hubble time. These power laws describe idealized single-component epochs rather than the full late-time expansion history.
Past exam of the mathematics course of the University of Cambridge 2010 ia Paper 4 9B Solution Created 2026-09-24 Updated 2026-10-14
For the moment of inertia of a uniform solid sphere, write the mass density as . In spherical coordinates about the chosen axis, the squared perpendicular distance is . The volume element is , so
Take and , with a fixed plane. The normal force has magnitude and is perpendicular to the plane. On the perfectly smooth plane there is no friction. Both gravity and the normal force have zero torque about the marble's centre, so a marble released from rest does not rotate. The component of Newton's second law down the plane is , henceThe normal force does no work because the velocity is tangent to the plane. Gravity is conservative, so mechanical energy, the sum of translational kinetic energy and gravitational potential energy, is conserved.
For rolling without slipping, let the static friction force have magnitude , pointing up the plane. It supplies the torque that spins the marble while reducing its translational acceleration. If is the angular velocity and the acceleration down the plane, the rolling constraint is , hence . The translation and rotation equations areThus andThese are the equations for rolling acceleration with rotational inertia; the plane must be rough enough to supply this static friction.
The point of contact is instantaneously at rest relative to the fixed plane, so static friction does no total work on the rolling marble. Equivalently, its translational power is and its rotational power is , which cancel. The normal force also does no work. Consequently mechanical energy is conserved here too, now with rotational kinetic energy included:where is the centre's height. No energy loss is implied by the presence of ideal static friction. Constant acceleration from rest gives
For the hollow marble, put in the same equations. The smooth-plane time is unchanged, while the rolling acceleration becomes . ThereforeThis again assumes rolling without slipping and enough static friction; the ratio depends on the mass distribution through its moment of inertia.
Past exam of the mathematics course of the University of Cambridge 2010 ia Paper 4 8E Solution Created 2026-09-24 Updated 2026-10-14
A set is countable if it admits an injective function into , equivalently if it is finite or can be listed in a sequence. The empty set is included; an infinite countable set has a bijection with .
Every rational number has a representation with and . For each , there are only finitely many such pairs with . List these finite levels successively, ordering each level by , and discard repeated fractions when they first recur. Every rational number appears in some finite level, proving .
For the uncountability proof, suppose all numbers in could be listed as . Choose each decimal expansion not to end in an infinite string of nines, and denote its th digit by . Set when , and otherwise. Then the decimaldefines a number in with a unique such expansion, since its digits are only and . It differs from at digit for every , contradicting the enumeration. This Cantor diagonal argument proves because its subset already is.
For the union of two countable sets , take injective functions and . The mapis injective: it is injective within each branch, and their images have different parity. Thus , regardless of overlap.
The property of says that both and its complement are dense subsets of the real line. Both possible cardinalities occur. To establish the needed density directly, given and , choose an integer . Then is rational and differs from by less than . For an irrational approximation, choose a rational within of and a positive integer large enough that . The number is irrational and lies within of ; irrationality follows from that of , since otherwise subtracting and multiplying by would make rational. To recall the latter fact, a reduced fraction would satisfy , forcing even and then even, contrary to coprimality. ThereforeThe second set is uncountable because, if it were countable, its union with would make countable. The same two density arguments give the required approximations from and from its complement in either example.
Finally, the condition on makes every one of its points an isolated point, so is a discrete subset of the real line. Enumerate all rational intervals with ; enumerate pairs of indices of the rational list by increasing sum and keep those whose endpoints have the required order. For each , its isolating neighbourhood contains a rational interval containing and no other point of . Assign to the least such index . Two distinct points cannot receive the same index, because that interval would then contain two members of . This gives an injective function and proves that discrete subsets of the real line are countable:Using the least index makes the assignment explicit and requires no arbitrary selection of an uncountable family of intervals.
There are unlisted articles, also show them or only show them.