Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the mathematics course of the year 1 of the natural sciences course of the University of Cambridge 2001 Paper 1 10 b Solution by
Codex 0 2026-10-20
Expand in components:If , all powers for vanish. The matrix binomial theorem, valid here because commutes with , therefore yieldsThese powers of the identity plus a square-zero matrix can also be proved by induction: . For the displayed example, directly, andThis is the repeated function composition of a shear mapping. The argument gives every nonnegative integer ; since , the same formula also holds for negative integers.
Past exam of the mathematics course of the year 1 of the natural sciences course of the University of Cambridge 2001 Paper 1 10 a Solution by
Codex 0 2026-10-20
Use the Einstein summation convention, with repeated component indices summed. The following three expressions are listed separately below. For cyclic invariance of the trace,where the middle equality commutes scalar entries, not the matrices themselves. If is invertible, this givesThis is similarity invariance of trace.
Past exam of the mathematical and Computational Biology course of the University of Cambridge 2025 Paper 2 7 e Solution by
Codex 0 2026-10-20
For the same concentration gradient, the front-to-back difference scales with cell length. A much smaller bacterial cell samples a correspondingly smaller spatial signal, while stochastic arrival and binding of individual chemoattractant molecules make receptor measurements noisy. For illustration, a cell in the cm capillary would experience only across its length, compared with for the longer cell. This illustrates a size penalty; it does not assume that bacterial and human detection thresholds are identical.
Many swimming bacteria, including Escherichia coli, use temporal sensing in bacterial chemotaxis: they compare recent receptor stimulation with an adapted baseline as they move. Increasing attractant suppresses reorientation and prolongs runs; decreasing attractant increases tumbling. Repeated runs and reorientations therefore generate a biased random walk up the gradient, without requiring a simultaneous comparison between the front and back. Chemotaxis feedback regulation supplies the adaptation needed to remain sensitive to changes rather than responding only to absolute concentration.
A discriminating experiment changes concentration rapidly and uniformly around the bacteria: a response then occurs without a spatial difference across the cell. The classic temporal-step experiments found increased tumbling after attractant decreases and smoother swimming after increases.[ref]
The gradient-sensing mechanism in bacterial chemotaxis by Robert M. Macnab and Daniel E. Koshland Jr.. pp. 2509–2512, Abstract and temporal-gradient response experiments
In a new experiment, compare up-steps and down-steps with constant-concentration and sham-mixing controls, holding temperature and medium composition fixed. Measure run durations and tumble frequency, rather than only average swimming speed. Such a test supports temporal comparison but does not by itself identify every molecular component or show that all bacterial species use the same mechanism. Past exam of the mathematical and Computational Biology course of the University of Cambridge 2025 Paper 2 7 d Solution by
Codex 0 2026-10-20
For a cell of length aligned with the capillary, the steady linear gradient produces the front-to-back concentration differenceAt the given initial length, , this is , above the stated threshold. Requiring givesThe diffusion coefficient does not enter this steady-gradient threshold. It does constrain experimental waiting time: for fixed reservoir concentrations, the slowest decaying mode of the diffusion equation has timescale . With the supplied , this is about hours at cm and days at cm; several such times may be required for an accurate steady state. Thus the maximum from the detection threshold is usable only if the reservoirs and cells remain suitable while the profile develops.
Past exam of the mathematical and Computational Biology course of the University of Cambridge 2025 Paper 2 7 c Solution by
Codex 0 2026-10-20
Take at chamber A and at chamber B. At steady state, the diffusion equation with constant positive diffusion coefficient givesThe two Dirichlet boundary conditions give and . ThusThe concentration gradient is constant, . By Fick's first law, the diffusive flux is , directed from A towards B. The profile is linear independently of , while the flux and the time needed to approach it depend on .
This result assumes no significant bulk flow, chemoattractant loss to the walls, degradation or cellular uptake. Experimentally, a uniform-concentration control with matched reservoir concentrations tests for directional cell migration caused by flow or apparatus asymmetry; reversing the reservoir concentrations tests whether the directional response follows the chemical gradient. Keeping both reservoirs well mixed and measuring the concentration profile checks the assumed boundary concentrations and whether uptake has distorted it. These controls distinguish the assumed passive diffusion field from other directional cues; the derived profile alone does not establish the mechanism of chemotaxis.
Past exam of the mathematical and Computational Biology course of the University of Cambridge 2025 Paper 2 7 b Solution by
Codex 0 2026-10-20
First convert the dynamic viscosity to SI units:Using the stipulated effective-size version of Stokes's law with , the drag coefficient isThe speed is , henceThe drag acts opposite the velocity. Its magnitude is about times smaller than the substrate force in (a); balancing surrounding-fluid drag alone therefore cannot account for the much larger substrate traction. The calculation uses the size parameter exactly as supplied. An exact drag calculation for a cube moving close to a wall would need geometry and boundary corrections beyond this stipulated approximation.
Past exam of the mathematical and Computational Biology course of the University of Cambridge 2025 Paper 2 7 a Solution by
Codex 0 2026-10-20
The substrate contact area is the square bottom face, so the total traction force magnitude is stress times area:By Newton's third law, the force exerted by the substrate on the biological cell has the same magnitude and opposite direction to the cell's force on the substrate.
Past exam of the mathematical and Computational Biology course of the University of Cambridge 2025 Paper 2 6 f Solution by
Codex 0 2026-10-20
The Louvain method approximately maximizes network modularity. Start with each vertex in its own community. Repeatedly visit each vertex, evaluate moving it into each neighbouring community, and accept the move with the greatest positive modularity gain. When no such local move improves the score, contract each community into a new weighted vertex, summing inter-community edge weights and retaining internal edges as self-loops. Repeat local optimization and contraction until no further gain is obtained, then map the communities back to the original vertices.[ref]
Fast unfolding of communities in large networks by Vincent D. Blondel and others. §2, Method, pp. 4–5 of the preprint: local moves followed by aggregation
For an undirected unweighted graph with edges, degrees of vertices and community labels , the objective isThe term subtracts the expected connectivity in a degree-based network null model. If all vertices are put in one community, the observed and expected total weights cancel, so . A partition with excess internal connectivity can have , and merging away that structure reduces the score. The modularity objective and positive-gain rule prevent arbitrary merging merely to increase cluster size. They do not forbid a single community in every possible network: if there is no better modular partition, one community may be an appropriate result. The method is a greedy heuristic, so it does not guarantee the global maximum of .
Past exam of the mathematical and Computational Biology course of the University of Cambridge 2025 Paper 2 6 e Solution by
Codex 0 2026-10-20
Factor the characteristic polynomial as . The eigenvalues, with algebraic multiplicity, are thereforeThe adjacency matrix describes a star graph with node 1 as the hub. For the positive leading eigenvalue , write the hub component as . The leaf equations , for , give equal leaf components . The hub equation is , which is consistent precisely because . Thus an eigenvector is .
Normalizing its Euclidean norm to one gives the eigenvector centralityNumerically this is . It satisfies both and . If “normalized” instead means maximum component one, use ; if it means components summing to one, divide by . The hub-to-leaf ratio is invariant under these conventions. The negative leading-magnitude eigenvalue also has an eigenvector, but its mixed signs do not define nonnegative eigenvector centrality.
Past exam of the mathematical and Computational Biology course of the University of Cambridge 2025 Paper 2 6 d Solution by
Codex 0 2026-10-20
Use degree-preserving edge rewiring, often called a double-edge swap. Select two edges and with four distinct endpoints, then replace them by and , choosing the reconnection symmetrically. Reject a proposal that would create a self-loop or an already present edge if the target is a simple graph. Each endpoint loses one edge and gains one, so every degree of a vertex, as well as the numbers of vertices and edges, is preserved exactly.
Repeat many such random proposals to generate reference networks. With symmetric proposals, retaining rejected steps as self-transitions, the uniform distribution on the reachable degree-preserving realizations is stationary. Adequate mixing must be checked; a few successful swaps do not establish an independent random sample. Degree preservation alone does not preserve connectedness, so impose and check that extra restriction if the graph distance comparison requires connected networks.
Past exam of the mathematical and Computational Biology course of the University of Cambridge 2025 Paper 2 6 c Solution by
Codex 0 2026-10-20
No. A scale-free network is characterized by an approximately power-law tail in its degree distribution, over a meaningful range. clustering coefficients and mean graph distances do not supply that distribution. One would need the degrees of vertices, enough observations over a substantial range, and a fitted power-law model assessed against alternatives. Four vertices cannot establish such a tail, even if their degrees were supplied. small-worldness alone does not imply a scale-free network.
Past exam of the mathematical and Computational Biology course of the University of Cambridge 2025 Paper 2 6 b Solution by
Codex 0 2026-10-20
Under the conventional criterion, the supplied summaries classify it as a small-world network: clustering is about times the reference value, while path length is only about times the reference value. Two reference random graphs permit a numerical comparison but do not establish the variability or statistical significance of that classification.
There is a literal consistency problem with describing these summaries as those of a four-vertex simple unweighted graph. Any finite graph distance is at most three, whereas the supplied mean path lengths exceed three. A local clustering coefficient with at most three neighbours can only be , , or under the usual definition, not or . Thus the result above is the intended calculation from the given summaries; they cannot all describe an ordinary four-node simple unweighted network. A larger network or a separately specified weighted convention would be needed for a literal network interpretation.
Past exam of the mathematical and Computational Biology course of the University of Cambridge 2025 Paper 2 6 a Solution by
Codex 0 2026-10-20
Average the four local clustering coefficients and the four supplied mean graph distances, using the same weighting convention for the reference networks:The two reference values average to and . The normalized small-worldness is the relative clustering divided by the relative path length,This uses the standard ratio-of-ratios definition, with the supplied degree-matched random graphs as the chosen reference ensemble.[ref]
Network ‘Small-World-Ness’: A Quantitative Method for Determining Canonical Network Equivalence by Mark D. Humphries and others. Results, New measures of small-world-ness, Definition 2 and the ratio of relative clustering to relative path length
Past exam of the mathematical and Computational Biology course of the University of Cambridge 2025 Paper 2 5 f Solution by
Codex 0 2026-10-20
Use the parameters from (e), and interpret overflow as the number needing simultaneous care exceeding capacity at a randomly chosen time in stationary distribution. The occupancy of the immigration--death process is not fixed at its mean. Detailed balance givesNormalizing yields , so stationary occupancy has a Poisson distribution with mean 25. Thus integer capacity must satisfyThe adjacent tails areSince the tail decreases with , the minimum capacity is . The small excess above at 31 matters; a normal approximation rounded too early can choose the wrong integer.
This is a stationary occupancy criterion. If the event is instead an offered arrival finding at least animals already present in this unrestricted process, Poisson arrivals see time averages gives , whose minimum qualifying capacity is 33. That uses a different event definition. From an initially empty centre, occupancy at a finite time is Poisson distributed with mean , so the stationary criterion also bounds the fixed-time overflow probability during initial filling. A probability of ever exceeding capacity over an unlimited future is a different question: this irreducible recurrent process will eventually exceed every finite capacity with probability one. If instead arrivals are refused when all places are occupied, that changes the model to an loss network, whose blocking probability is not the unrestricted occupancy tail calculated here.
Past exam of the mathematical and Computational Biology course of the University of Cambridge 2025 Paper 2 5 e Solution by
Codex 0 2026-10-20
Setting the mean equation's derivative to zero givesWhen the actual current occupancy is , the next admission has exponential distribution rate five and the next discharge has rate . The memoryless property makes these independent competing clocks conditional on the current occupancy. ThereforeThe rate comparison uses the actual stated occupancy. Knowing only the mean occupancy would not justify replacing the random inside by its mean.
Past exam of the mathematical and Computational Biology course of the University of Cambridge 2025 Paper 2 5 d Solution by
Codex 0 2026-10-20
Admissions add to the expected value at rate , while the expected aggregate discharge rate is . ConsequentlyMultiplying this linear ordinary differential equation by the integrating factor givesIntegrating from zero, using , gives . HenceIt starts at zero, has initial slope , and approaches as , as the admission and discharge rates balance.
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





