Topics (282k) Articles (291k) Users (354) Discussions (237) Comments (383) Files (6k) New article
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 38B i Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-05
Linearized mass conservation, momentum balance and the isentropic pressure-density relation are , , and . Differentiate mass conservation in time and take the divergence of momentum balance to eliminate velocity. This gives the acoustic pressure wave equationFor the convention , momentum balance gives the complex velocity amplitude , with . Thus the incident velocity field is in the lower gas.
Let , , , and with nonnegative real or imaginary part. This chooses an outgoing propagating wave or an evanescent wave decaying as . Conservation of tangential wavevector is the acoustic Snell law for elastic and acoustic waves. Write the complex pressures asInviscid kinematic matching requires equal normal velocities at the plate, not equal tangential velocities:Define the normal acoustic impedance ratio , so . For a propagating transmitted wave this is . The dynamic condition giveswhich is exactly the printed dimensionless parameter. Solving yields the pressure reflection coefficient and transmission coefficientAt use the preceding velocity equations, or take their limit, rather than substituting an infinite . For real , the reflected energy fraction is , the transmitted fraction is , and these sum to one. An evanescent transmitted wave carries no mean normal energy flux.
When the gases match, , so and . For a nongrazing incident wave of nonzero frequency, perfect transmission means , equivalent toThe plate's inertial and bending terms cancel: the incident frequency and tangential wavevector coincide with its free flexural wave dispersion relation. Then , including its phase. With positive , this condition is possible only at angles and frequencies satisfying that relation; for normal incidence at nonzero frequency it cannot occur unless the mass is zero.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 30A b Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-05
For , put and use the positive-definite Lyapunov function . Its derivative isFor set . The brace divided by is , where , and . Since , . Completing the square gives its maximumHence . If , this sublevel region is positively invariant: decreases, and . The exponential bound makes . The trajectory is bounded in a compact ellipse, so smoothness of the vector field also guarantees existence for every positive time. ThereforeFor the displayed strict inequality has no solutions; negative gives the same ellipse as . Taking the union of the nonempty ellipses is valid because each point needs only one Lyapunov certificate.
At the certified disk has squared radius . Along , the limiting threshold as is , which is strictly larger, since their difference is for . Choose strictly between these thresholds and then a sufficiently large finite . This point is certified by that ellipse but lies outside the disk. Thus the union gives a strictly larger certified region. It need not equal the whole basin of attraction.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 30A a Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
The equilibrium equations are . For the fixed points are the origin, four axis points , and four diagonal points with independent signs and . The hypothesis ensures that is real. The Jacobian matrix has diagonal entries , and off-diagonal entries .
At the origin both eigenvalues are , so it is a stable node. At each axis point the eigenvalues are . At each diagonal point they are , along the radial and transverse diagonal directions respectively. ThusThe axes and diagonals are invariant lines. For the axis saddle points have stable directions transverse to their axes and unstable directions along them; the diagonal points are unstable nodes. For these roles switch: the diagonal saddle points have stable transverse directions and unstable radial directions, and the axis points are unstable nodes. Their stable manifolds separate trajectories attracted to the origin from outward-escaping trajectories. Symmetry gives the other quadrants.
For , the entire unit circle consists of equilibria. In polar coordinates and : every ray inside the circle moves toward the origin, and every ray outside moves outward. The circle has neutral tangential and unstable radial directions; its points are not isolated saddle points or unstable nodes.
All three phase portraits are shown below. The potential satisfies and , ruling out nonconstant periodic orbits. Blue curves show the saddle stable separatrices, integrated backwards from their local stable directions. The flow arrows and invariant lines, together with the equilibrium classification, specify the topology of the sketches.
Phase portraits and equilibrium branches
. Details. Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 29J c Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-05
The bounded-time optional stopping theorem states that if is an integrable discrete-time martingale and is a stopping time bounded by a deterministic integer , then is integrable and . Indeed proves integrability, andThe event belongs to . Conditional expectation of each summand given is zero, soMore generally, if are stopping times, . To prove this, test against and apply the same argument to ; its coefficient is -measurable. Boundedness of the stopping times makes the sums finite, so no limiting optional-stopping hypothesis is being omitted.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 29J b Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-05
Inductively, are functions of , so . The average is therefore -measurable and independent of . If are integrable, thenStarting with , induction proves integrability of every . Adaptation holds by definition of the natural filtration. Independence and zero mean now legitimately giveHence the process is a martingale. Only first moments are used; no second-moment or boundedness assumption on the increments is needed.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 29J a Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-05
A martingale with respect to a filtration is an adapted process: is -measurable for every . It must satisfy andBy the tower property this is equivalent to for all . Integrability and adaptation are part of the definition, not consequences of writing a formal conditional-mean identity.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 28K b iii by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 28K b ii by
Codex 0 Created 2026-09-24 Updated 2026-10-05
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 28K a Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-05
For observation , the likelihood is proportional to . For , its logarithmic derivative is , vanishing uniquely at ; the logarithm is strictly concave. At or , monotonicity gives the boundary maximum. Thus the maximum-likelihood estimator isA uniform prior multiplies this likelihood by a constant. The beta-integral normalization therefore gives the posterior distributionIn particular the posterior mean is not automatically the optimal estimator for the weighted loss in the next part.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 27K c Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-05
Write . The embedded birth-death chain moves upward with probability and downward with probability away from zero. The gambler's ruin formula, obtained by solving its two-point difference equation on and then letting , gives . Translation gives return probability from to . From the chain hits almost surely: before that hit it remains in a finite reflecting interval, from every state of which a uniformly positive finite-step chance of hitting is available. This also proves that starting at zero it hits each almost surely.
After departure from the return probability is thereforeThe holding rate is , so the exponential occupation-time parameter is . Applying the Strong Markov property at the almost-sure first hit givesAt zero the holding rate is and return probability after departure is , again giving parameter . From initial state , the expected occupation time at zero is , since the time is zero unless zero is reached. Averaging over the initial law with probability generating function yieldsFor , the interpretation is , for , and ; the same formulas hold.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 27K b Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-05
Let be the probability of returning to after its first departure. Transience means ; in particular . By the Strong Markov property, the number of visits, including the initial visit, has the geometric distribution , . The holding times of these visits are independent variables and are independent of the jump-chain return decisions.
For the total occupation time of a continuous-time Markov chain and , summing over givesUniqueness of the Laplace transform identifiesStarting elsewhere adds an atom at zero if the state might never be hit; the purely exponential conclusion uses the specified initial state .
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 27K a Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-05
A time-homogeneous continuous-time Markov chain on a countable state space is a stochastic process with the Markov property: conditional on the current state, the law of its future depends on neither its past nor the current time. In the usual conservative, nonexplosive setting its sample paths are right-continuous step functions. Its Q-matrix has for , , and infinitesimal transition probabilities for .
On entering , the holding time has distribution ; independently, the next state is with probability . The successive states form the jump chain, whose transition probabilities areIf , the state is absorbing, its holding time is infinite, and the jump-chain convention is . Nonexplosion ensures this construction defines the process for all finite times rather than accumulating infinitely many jumps in finite time.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 26J e Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-05
The set of finitely disagreeing pairs is , where consists of pairs whose digits agree at every position beyond . For , requiring agreement just at positions defines a union of dyadic rectangles of total area : among the pairs of length- prefixes, exactly meet these matching constraints, each rectangle having area .
Since is contained in each of these finite-prefix agreement sets, its measure is at most for every , hence zero. Countable subadditivity now givesThus almost every pair disagrees in infinitely many digits. Dyadic endpoints, treated with the stipulated expansion convention, do not change any rectangle measure.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 26J d Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-05
Each function is Borel measurable on the product square, by composition with its coordinate projections and arithmetic of measurable real functions. Its value is one exactly when the th digits disagree. Therefore the partial disagreement countsare nonnegative Borel functions and increase to the extended-real function . For every finite , is Borel. HenceInfinite disagreement is allowed, so restricting the target to finite real values would lose part of the stated function.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 26J c Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-05
The chosen non-eventually-one binary expansion fixes the ambiguity at dyadic rationals. Its th digit isIn particularThis is a finite union of Borel sets; the zero-digit preimage is its complement in . Since only takes the values zero and one, every Borel preimage is a union of these two sets. Thus it is Borel measurable. The half-open intervals implement the terminating-zero convention at dyadic endpoints.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 26J b Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-05
Let be Borel measurable and converge pointwise to the finite real value . For every real ,If , choose a rational strictly between them; convergence puts eventually. Conversely eventual strict inequality implies . The right side belongs to by its countable union/intersection operations. Since these half-lines generate the Borel sigma-algebra, is a Borel measurable function.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 26J a Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-05
The Borel sigma-algebra is the smallest sigma-algebra containing all open subsets of . A real-valued Borel measurable function on is a map with for every . It suffices to test the sets for rational , because these generate the Borel sigma-algebra.
Here “Borel function” describes measurability into the Borel structure of the target; the domain need not itself be a topological space.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 24I d Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-05
The semicubical parabola has coordinate ringunder , . The isomorphism is valid in every characteristic: after division by the monic polynomial in , a remainder maps to a sum of distinct even powers and odd powers at least three, and can vanish only when both polynomials are zero.
Its fraction field contains , which is an integral element over because it satisfies . However , since a polynomial in has no term of degree one. Thus is not an integrally closed domain. The ring of the affine line is a principal ideal domain and therefore an integrally closed domain. This property is preserved by ring isomorphism. By coordinate-ring functoriality,The parametrization is a bijection on points over an algebraically closed field, but that does not make its inverse a morphism at the cusp.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 24I c Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-05
An isomorphism of affine varieties and its inverse pull regular functions back to regular functions. By the preceding identification this gives k-algebra homomorphismsThey preserve sums, products, and every constant in . Contravariance of pullback and , give and . Hence
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 24I b Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-05
Let . Polynomial restrictions are regular functions, and a restriction is zero precisely when its class in the coordinate ring is zero. We prove surjectivity.
Using the usual irreducible-variety convention, view a regular function as an element of the fraction field of . On a neighbourhood of every point it has the form , where and does not vanish at that point. Equality on a nonempty open subset of the irreducible variety is equality of rational functions. DefineThis is an ideal and contains a denominator nonzero at each point. Thus its zero locus is empty. The Hilbert Nullstellensatz implies , so and . ThereforeThe result also holds under a convention allowing reduced reducible affine varieties. One may cover by finitely many principal opens , represent in each localization, and increase powers until the local representatives glue after clearing denominators. Since these opens cover, the ideal generated by those powers is the unit ideal by the Nullstellensatz; a unit linear combination glues their numerators to one element of . Irreducibility is used only for the shorter fraction-field proof, not for the assertion itself.
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






