Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 29J b Solution Created 2026-09-24 Updated 2026-10-14
Use the usual state-space assumption that the prior is independent of future process and observation noises. Suppose inductively . Prediction through the linear dynamics gives , where . The pair is conditionally multivariate normal, with means , cross covariance , and observation covariance . Applying part (a) gives the Kalman filterThis proves the inductive Gaussian assertion. The inverse requires nonsingular innovation covariance, as in the printed formula. Importantly, prediction uses : the TeX conversion drops this in one place, whereas the original PDF includes it.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 29J a Solution Created 2026-09-24 Updated 2026-10-14
Assume is invertible. PutThis and are jointly multivariate normal, with and . Their joint Gaussian characteristic function factors when the cross covariance vanishes, so they are independent. Conditioning on therefore leaves the law of unchanged, proving
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 27I e Solution Created 2026-09-24 Updated 2026-10-14
Passing to the deterministic-service limit in part (c), near zero, givesDifferentiation at zero gives . Alternatively, the same branching expectation equation gives for every , because . The assumed convergence of finite moment-generating functions at a positive point near zero bounds exponential moments and makes these means uniformly integrable, so the means pass to the limit. Since , the answers areThey correspond to an M/D/1 queue with deterministic service time . The calculation only needs finite transforms near zero; the literal assumption of finite transforms for every is stronger than necessary and is not generally true for positive busy-period arguments. For instance, with and , part (c) gives . Its discriminant is negative for , so no finite busy-period transform can exist there.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 27I d Solution Created 2026-09-24 Updated 2026-10-14
The first arrival time has an exponential distribution of rate and is independent of the following busy period. ThusSubstitute into part (c). Its service-transform argument becomes . ThereforeAs before, positive arguments must lie in the domain of finite moment-generating functions.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 27I c Solution Created 2026-09-24 Updated 2026-10-14
For the busy-period branching equation, during the first service of a busy period, every arriving customer initiates a subtree of further work. The independence and stationary increments of the Poisson process, together with independent services, give the distributional recursionwhere conditional on , is Poisson with mean , and the descendant busy periods are independent copies of . One may explore these subtrees in order; the server's total workload is unchanged by that ordering. Consequently, wherever the moment-generating functions are finite,For , this identity in particular holds in a sufficiently small neighbourhood of zero.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 27I b Solution Created 2026-09-24 Updated 2026-10-14
An M/G/1 queue has Poisson process arrivals of rate , independent identically distributed service times of law , one server, and here infinite waiting capacity. Use first-come-first-served service. Let be the number left just after the th departure. During the next service, let be the number of arrivals. ThenConditional on the next service time , is Poisson with mean . If , the server waits for one arrival to start service; that arrival is the customer being served, and is not counted in . This constructs the embedded Markov chain.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 27I a Solution Created 2026-09-24 Updated 2026-10-14
Independence and the moment-generating function of an exponential distribution giveFor each fixed , taking logarithms and using yields . The limiting service time is the constant . Its moment-generating function is exactly this limit.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 25H iii Solution Created 2026-09-24 Updated 2026-10-14
For the anticlockwise boundary of the region, the inward normal is the left normal, so the signed curvature obeys the turning tangent theorem . Therefore some has . The enclosed area satisfies , and the planar isoperimetric inequality gives . ConsequentlyThis uses the interpretation of the curve as a simple boundary traversed once; the inward normal and enclosed region in the question have that meaning.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 25H ii Solution Created 2026-09-24 Updated 2026-10-14
The Fenchel theorem states that every closed regular space curve has total curvature at least :Equality holds precisely for a convex plane curve, traversed once.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 25H i Solution Created 2026-09-24 Updated 2026-10-14
For a regular simple closed plane curve of length enclosing area , the planar isoperimetric inequality is , with equality precisely for a circle.
The periodic Wirtinger inequality states that an absolutely continuous -periodic function of mean zero with square-integrable derivative satisfieswith equality only for a linear combination of and . Parametrize the curve by arc length and translate its position vector so that both coordinate means vanish. Then , since . Green's theorem and the Cauchy-Schwarz inequality giveEquality requires a first-harmonic parametrization and equality in Cauchy-Schwarz; its radius vector is a constant multiple of the rotated unit tangent. It is therefore a circle. Conversely, a circle attains equality.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 1G ii Solution Created 2026-09-24 Updated 2026-10-14
Euler's criterion gives in this case. There are equally many nonzero quadratic residues and quadratic nonresidues, so . Replacing by and using the multiplicativity of the Legendre symbol givesConsequently .
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 1G i Solution Created 2026-09-24 Updated 2026-10-14
Put . The nonzero quadratic residues in the finite field form a subgroup of size : the group homomorphism has kernel . Each square satisfies by Fermat's little theorem. Since a nonzero polynomial of degree has at most roots of a polynomial, these are all the roots of . For any other nonzero , Fermat's theorem gives , so . Thus Euler's criterion follows, and multiplication givesBoth sides are or , which are distinct modulo the odd prime number , so . Taking in Euler's criterion gives , which is for and for .
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 19F ii Solution Created 2026-09-24 Updated 2026-10-14
Each -conjugacy class represented by has elements. For every element of that class, the number of conjugators from to it is . Grouping the induced character formula by these classes therefore gives
In the example, has order four, has order two, and , so . Its five conjugacy classes are , , , and , of sizes . The four one-dimensional irreducible characters are determined by and , each sign independently chosen. The remaining two-dimensional irreducible character comes from the plane action of the square:Their squared degrees sum to eight, so this is the full character table.
In , use class representatives . Their intersections with are respectively , , , the empty set, and . The corresponding centralizer orders are , while the noncentral centralizers have order four. The induced values are consequentlyIn the same class order, all five induced irreducible characters are
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 19F i Solution Created 2026-09-24 Updated 2026-10-14
In the induced character formula above, there are no with when the conjugacy class of misses . The sum is empty, so .
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 17F iv Solution Created 2026-09-24 Updated 2026-10-14
No. In the six-cycle with cyclic vertices , every edge belongs to one of the two alternating perfect matchings. However, the disjoint edges and cannot belong to a common perfect matching: the remaining vertices are not adjacent. Taking and gives the required bipartite graph counterexample.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 17F iii Solution Created 2026-09-24 Updated 2026-10-14
Take a disjoint union of single edges, each joining one vertex of to one of . Its unique matching in a graph covering contains every edge, while any singleton satisfies . For this is nonempty and proper. This illustrates why connectedness was needed in part (ii).
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 17F ii Solution Created 2026-09-24 Updated 2026-10-14
Suppose a nonempty proper is tight. In every matching in a graph covering , the vertices of use every vertex of . Hence no edge from to could occur in such a matching. The assumption that every edge occurs therefore rules out all such edges. By definition there are also no edges from to . This separates from the rest, which contains the nonempty set , contradicting connectedness. Hall's inequality must therefore be strict on every nonempty proper .
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 17F i Solution Created 2026-09-24 Updated 2026-10-14
Fix any edge . After deleting and , every nonempty subset of satisfies , by the strict inequality in the question. The Hall marriage theorem gives a matching in a graph for the remainder; adding gives a matching covering and containing the prescribed edge. The case is immediate.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 11F iv Solution Created 2026-09-24 Updated 2026-10-14
No such map exists. If fixed the boundary, it would satisfy the hypothesis of part (iii) for every . Choose . Then part (iii) would give , contradicting the stipulated omission of . Equivalently, radial projection from the omitted point would turn into a forbidden retraction.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 11F iii Solution Created 2026-09-24 Updated 2026-10-14
Fix with , and let be radial projection to the closed disc. The continuous map has a fixed point by the Brouwer fixed-point theorem. On the boundary, , so its image under is interior and cannot equal the boundary point . Therefore . An interior fixed point of this projection must satisfy , because points outside the disc project to its boundary. Thus . Every belongs to .
There are unlisted articles, also show them or only show them.