Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the topics in applied mathematics course of the University of Oxford 2007 A 2 iii Solution by
Codex 0 2026-10-31
Use , and slow time . Dividing the equations by their respective concentration and time scales givesThus and . Notice that and the physical enzyme fraction satisfies . The initial values are , for this particular normalization; the threshold analysis compares different initial substrate abundances using a fixed reference scale.
Past exam of the topics in applied mathematics course of the University of Oxford 2007 A 2 ii Solution by
Codex 0 2026-10-31
Past exam of the topics in applied mathematics course of the University of Oxford 2007 A 2 i Solution by
Codex 0 2026-10-31
Past exam of the topics in applied mathematics course of the University of Oxford 2007 A 1 v Solution by
Codex 0 2026-10-31
A fixed point of is also a fixed point of . By the chain rule,If the original fixed-point multiplier has modulus greater than one, its square also exceeds one, so the same fixed point is unstable for the twice-iterated map. New stable fixed points of the twice-iterated map, if present, must be different points; they can represent a genuine two-cycle of the original map.
Past exam of the topics in applied mathematics course of the University of Oxford 2007 A 1 iv Solution by
Codex 0 2026-10-31
At low density the per-generation growth factor is approximately . The power controls how sharply crowding reduces recruitment or survival when resources become limiting; at high density . Larger therefore means a stronger overcompensation in a population model.
The flip threshold says that sufficiently strong density feedback can destabilize a constant positive biological population and create alternating generations, under the usual nondegeneracy conditions. A local loss of fixed-point stability alone does not establish chaos, nor does it prove every ecological system with stronger crowding must follow the same route.
Past exam of the topics in applied mathematics course of the University of Oxford 2007 A 1 iii Solution by
Codex 0 2026-10-31
The fixed-point multiplier decreases continuously with and first reaches the unit circle at . Solving givesIt is stable for and unstable for . At the critical value linear stability is inconclusive. The crossing at is the local signature of a period-doubling bifurcation, rather than a crossing through .
Past exam of the topics in applied mathematics course of the University of Oxford 2007 A 1 ii Solution by
Codex 0 2026-10-31
A positive fixed point requires , so it exists exactly when and is . Differentiating the map at it givesFor and , this fixed-point multiplier is strictly between and . Hence the positive fixed point is linearly asymptotically stable, including ; positivity of makes the lower bound strict.
Past exam of the topics in applied mathematics course of the University of Oxford 2007 A 1 i Solution by
Codex 0 2026-10-31
The iteration of a map is . For every , , so and . A cobweb alternates vertical steps to the graph and horizontal steps to the diagonal, approaching the origin monotonically.
More precisely . The product has a finite strictly positive limit because . Thus for a positive constant depending on the initial biological population.
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






