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 43 5 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A natural cubic spline interpolant satisfies , is twice continuously differentiable, and is a polynomial of degree at most three on each interval . Its natural boundary conditions areIf defined outside the data interval, it continues linearly on both exterior intervals. Thus function values and the first two derivatives match at the knots, but the third derivative may jump.
For an explicit construction, let and . Set and solveOn , putThis formula interpolates the values and matches second derivatives; the tridiagonal equations enforce first-derivative matching. The homogeneous system has only the zero solution: in a row with maximal nonzero , its diagonal coefficient strictly exceeds the sum of its neighbour coefficients, making cancellation impossible. Thus the natural interpolant exists uniquely.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 43 5 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A Gaussian generalised additive model with the identity link specifiesThe are unknown smooth functions estimated from the data, rather than necessarily straight lines. The model is additive in their effects, so it does not automatically contain interactions between covariates. To identify the intercept separately from the smooths, impose a constraint such as for each . Linear terms can also be included alongside smooth terms. More generally a specified link function can make additive; for the normal identity-link model the mean itself has the displayed form. Smoothness is typically controlled through a basis and a roughness penalty, preventing an unrestricted smooth from interpolating all the noise.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 43 3 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The null model uses one parameter, the day model uses nine, and there are grouped observations. The four missing entries, in their table order, are thereforeThe test of no day effect is . The nominal binomial likelihood-ratio test statistic is , compared asymptotically with . Its nominal -value is about , so the common-probability model is decisively inadequate relative to the day model. The fitted probabilities in (i) show substantial differences between days, with days 1 and 7 much higher than days 3 and 8.
However, relative improvement does not establish absolute fit. The day model's deviance goodness-of-fit test compares with , giving . The counts are large enough for this approximation to be reasonable. Thus at the day-specific binomial model still shows lack of fit. Among the two printed models it is preferred, but it should not be regarded as a fully satisfactory final model.
The residual scale estimate suggests overdispersion. Directly computing the Pearson statistic from the day means givesThis corroborates extra dish variation rather than the nominal binomial variance. Dish heterogeneity or dependence among cells in a dish can produce such variation. Residual checks and a quasibinomial regression or an explicit model for dish heterogeneity are sensible refinements. Allowing dispersion of this moderate magnitude would enlarge standard errors but would not plausibly remove the very large day effect. Retain day effects, while accounting for the remaining extra-binomial variation.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 43 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
factor(day) treats the nine days as categorical rather than imposing a numerical time trend. rep(400,27) supplies the number of trials for every dish, and prop is the observed surviving proportion. The contrast setting uses treatment coding with day 1 as reference; the ordered-factor polynomial option is unused. Supplying these proportions to glm with the binomial family and weights gives precisely the grouped-binomial logistic regression likelihood for the counts. The weights represent trial counts, not additional independent dish observations. The binomial family's default link is the logit link and its dispersion is fixed at .Let be survivors in dish on day . Both fitted models assume independent . Model 1 specifiesso it has one common probability and one fitted coefficient. Its estimated probability is the total surviving count divided by the total trial count, .
Model 2 specifiesIt has nine coefficients and allows a separate probability for each day, while retaining a common probability for the three dishes within that day. The MLEs are the day totals divided by . In day order they areThe intercept is the first day's logit, and each other coefficient is its day's logit minus that reference. These are additive effects on log odds, not additive changes in survival probability.
The analysis of deviance adds the eight day indicators after an intercept-only model. Its residual deviance compares a fitted model with the saturated statistical model assigning one separate probability to each of the dishes. For fitted dish probabilities , the binomial deviance isThe binomial scale is one, so this is also scaled deviance. The reported decrease measures the extra fit provided by day. There are observational units for these residual statistical degrees of freedom, not separately fitted Bernoulli responses.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 41 2 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For the Cox-Ross-Rubinstein diffusion approximation, fix calendar maturity , take , and choose , , and the one-step bank factor . For sufficiently fine mesh, . The risk-neutral probability expands asEach stock log-increment is . Its mean under is and its variance is . Independent increments, their vanishing maximum size, and the Donsker invariance principle for this triangular array give the path limitExponentiation gives the geometric Brownian motion of the Black-Scholes model, and the bank account tends to .
The physical model is matched by taking . Its corresponding limit has log drift , so . The likelihood ratios from part (ii) have the matching continuous-time limit. With , a Taylor expansion of their two possible log-multipliers giveswhere is or . Thus the limiting Radon-Nikodym derivative is the Girsanov theorem density , turning the physical stock drift into .
The binomial risk-neutral pricing formula converges to for bounded continuous terminal payoffs by convergence in distribution. For ordinary call and put payoffs, uniform stock second-moment bounds give the required uniform integrability and hence convergence despite unboundedness. Bounded payoffs with discontinuities only at events of zero limiting probability are handled by the same weak-convergence criterion. Corresponding continuous path functionals can be treated at the process level. Arbitrary discontinuous path claims do not follow from weak convergence without further conditions. In the smooth limiting model, the discrete hedging difference quotient becomes the delta hedge , and its value satisfies the Black-Scholes equation.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 41 2 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
In a complete market, terminal-wealth optimization can first be solved over terminal payoffs and then implemented by replication. Let initial wealth be , and take an increasing differentiable strictly concave utility function on satisfying the Inada conditions. The state-price budget constraint for a terminal wealth is . Monotonicity spends the whole budget at the optimum.
Let be the inverse marginal utility. Choose to satisfy . In a finite tree with positive state probabilities, this left side is continuous and strictly decreasing from infinity to zero, so exists uniquely. The complete-market terminal utility optimizer isTo prove optimality, concavity gives . Taking expectations and using the budget proves . Strict concavity gives uniqueness of the optimal terminal wealth. The finite-market setting avoids additional infinite-state existence and integrability issues.
Replicate using the backward recursion of part (i). Its wealth process is , and the two-successor difference quotient gives its stock holdings. This self-financing strategy starts with by the budget equality and remains positive at every node, since it is the discounted conditional expectation of a strictly positive terminal wealth.
For logarithmic utility, , , the multiplier is and . For CRRA utility with risk aversion , , the normalized payoff isConstraints such as prohibiting short sales change the attainable terminal-payoff set and require a constrained optimization; the unconstrained complete-market formula uses the stated assumptions.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 41 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Suppose under the physical measure the up indicators are independent with probability . If is the number of up moves through date , a particular history has probability under and under . Thus the binomial-market probability density, the Radon-Nikodym derivative on , isIt is strictly positive. Its next multiplier has conditional expectation , so is a mean-one martingale and . These facts verify normalization and equivalence of the two probability measures.
The state-price density for terminal cash is . In particular . At an intermediate date the conditional change-of-measure identity givesIf physical up probabilities depend on the past, replace the constant-probability expression by the product over periods of on an up move and on a down move. Each multiplier still has conditional mean one, provided , and the pricing measure retains conditional up probability .
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 41 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Consider a binomial market with dates , bank account for , and stock price or , where . Both moves have positive physical probability, and the information at date is the history of the first moves. Absence of arbitrage requires and is implied by . If , borrowing cash to buy stock has nonnegative payoff with a strict gain in one state; if , the reverse trade does. In the interior range, the risk-neutral probability of an up move isIt makes , so is a martingale. This proves absence of arbitrage by pricing discounted gains under the equivalent measure.
At a node with stock price , let the desired next-period portfolio values be . Solve the two replication equations and . The replicating portfolio in a binomial market hasIts current value isRebalance at the next node using exactly the value supplied by the previous holdings, so the strategy is self-financing. Backward induction from any terminal contingent claim gives its hedge and the unique priceThus the finite binomial market is a complete market. The construction works for path-dependent claims on the full history tree, even when their values do not recombine merely as functions of the current stock price. For , independence under gives the explicit time-zero priceThe stock hedge is a difference quotient of successor values, the discrete analogue of the delta hedge.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 41 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Suppose . We first justify the finite-dimensional fact , since itself need not be closed. Around any relative-interior point , choose a small simplex in whose vertices lie in and which contains strictly inside. Approximate its vertices by points of , possible because . For close enough approximations, the barycentric coordinates of remain strictly positive; hence is a convex combination of points of and belongs to . If , the assertion is immediate.
Let . Relative openness lets us choose such that . There is therefore a bounded nonnegative measurable satisfying . SetThen and . This proves existence with strict positivity even when the unweighted asset vector is not integrable.
It also proves the strictly positive barycentre cone lemma. Every strictly positive weighted barycentre must lie in : otherwise the supporting vector constructed for the relative boundary would have zero value at that barycentre while its strictly positive weighted payoff had positive expectation. Thus the relative interior is exactly the set of such barycentres.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 40 6 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Several other approaches illustrate the range between fast heuristics, certified bounds and approximation schemes.
Sorting weights in decreasing order before greedy assignment avoids the example : it starts with the weight , then places both unit weights in the other bin, giving the optimum. This is a useful scheduling heuristic, although improvement on one example is not a proof of an arbitrary claimed approximation ratio. Local improvement can additionally move a single item or swap items between bins whenever it reduces the maximum load; it produces a local optimum, which need not be global.
A linear-programming relaxation replaces by . The choice for every item gives load in both bins, and summing the load constraints shows that no smaller relaxed value is possible. Together with the indivisibility bound this provides a lower bound on the integer optimum. Any feasible heuristic schedule gives an upper bound . Their ratio is a computable quality certificate. Branch-and-bound can improve these bounds by fixing assignment variables and solving subproblems, although worst-case exact running time need not be polynomial.
For integer weights one can instead solve the problem exactly by dynamic programming. Start with attainable subset sums and updatediscarding values above . Let be the largest retained sum. Choosing that subset for one bin gives loads and maximum , which is optimal because every partition has a lighter side of weight at most . The running time is pseudopolynomial: it depends on numeric magnitude, not merely the binary length of .
This exact algorithm also yields rounded dynamic programming for two-bin load balancing. For rational weights and , choose and scaled integer weights . Their total is at most , so exact dynamic programming on them costs arithmetic operations. Let be its optimal scaled maximum load. The original optimal partition is feasible for the scaled problem with load at most , so . When the scaled partition is lifted, each bin contains at most rounding errors, each smaller than . Therefore its original maximum load satisfiesThis is a fully polynomial-time approximation scheme: for each requested tolerance it gives a certified feasible solution in time polynomial in the encoded rational input and , with rational arithmetic accounted for. It works here because two-bin balancing has the subset-sum structure; one cannot infer that arbitrary combinatorial optimization problems admit such a scheme.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 40 6 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the relative-error approximation for minimization convention: an -approximation returns a feasible solution of value with on every instance, where is the optimum. Equivalently the relative excess is at most ; the multiplicative-ratio convention reports instead.
Before item is assigned, the total load already placed is . The lighter of two bins has load at most half that total. Positivity of the weights givesChoose a bin attaining the final maximum load , and let be its last assigned item. No later item enters that bin, soEvery feasible schedule has and . HenceThe ordered weights make the greedy loads after two assignments and then , regardless of how the final tie is resolved. The optimal partition has loads . Thus the factor is attained, not merely a loose bound. We conclude the sharp greedy two-bin scheduling bound
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 40 6 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let indicate that item is placed in the first bin; otherwise it is placed in the second. The two-bin load balancing problem has the familiar mixed-integer formulationThe continuous variable becomes the maximum of the two bin loads at an optimum. A pure binary integer program, avoiding any integrality assumption on the weights or on , is obtained by labelling a heavier bin as the first bin:The constraint ensures that the first load is at least the second, so the objective is their maximum. Every partition can be relabelled in this way, and every binary solution gives a partition. Thus this all-integer assignment formulation has exactly the original optimal value.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 40 5 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
With reserve price , an English auction makes no sale if both valuations are below . If exactly one exceeds it, the price is ; if both exceed it, the price is their minimum. ThusThe first term accounts for one qualifying buyer, and the integral uses the density of the smaller valuation. Differentiation gives . It increases up to and decreases afterwards, while the endpoints give and zero. ThereforeThe strict sale condition at the reserve changes only a probability-zero event.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 40 5 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
In an ideal continuous-price English auction, staying active until one's private valuation is optimal: dropping earlier can forgo positive surplus, while staying later risks paying more than the car is worth. The highest-valued buyer therefore wins, paying the price at which the other buyer drops out, namely .
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 40 5 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A buyer accepts a posted price precisely when their valuation exceeds it; equality has probability zero. The independent uniform valuations therefore give probability that neither accepts, for . The seller's expected revenue isThe interior critical point is , with negative second derivative; the endpoint revenues are zero. Prices above one make no sale and nonpositive prices cannot improve on this positive optimum. HenceWhich willing buyer is served if both accept does not affect this revenue.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 40 4 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The core of a cooperative game consists of efficient allocations satisfying for every coalition, so no coalition can obtain a greater total payoff by leaving. Efficiency has already been checked. For singletons,For pairs,The empty constraint is automatic and the grand constraint is equality. Thus every core inequality holds andAll four assertions about this allocation are true, although their definitions impose different requirements.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 40 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For an imputation , the excess of a coalition is . Arrange these excesses in decreasing order. The nucleolus is the imputation that lexicographically minimizes this ordered vector: minimize the largest complaint first, then the next largest among ties, and so on. The empty and grand-coalition excesses are fixed at zero for every efficient allocation, so they can be omitted without changing the lexicographic comparison.
For every efficient the three pair excesses have sumHence at least one pair has excess at least , and the largest proper-coalition excess is at least . At the proposed allocation all three pair excesses equal , while all three singleton excesses equal . It therefore attains the best possible largest proper-coalition excess.
Moreover, any allocation attaining this bound must have all three pair excesses equal , since they are individually at most that value and sum to . This forceswhose unique solution is . It is already an imputation, so the first nonconstant lexicographic stage has a unique minimizer; there are no later choices to resolve. Therefore
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 40 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The Shapley value is the expected marginal contribution of a player when the players join in uniformly random order. Equivalently,For three players, the weights for predecessor sets of sizes are . Using the computed values,Thus
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 40 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A payoff allocation is Pareto efficient if no feasible allocation weakly increases every player's payoff and strictly increases at least one. Here feasibility requires total payment at most the available estate. The proposed payments haveAny such improvement would have total payment greater than , which is impossible. Each payment is also between zero and its claim, and exceeds its singleton coalition value. Hence the allocation is an imputation and
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





