Topics (282k) Articles (291k) Users (352) Discussions (237) Comments (383) Files (6k) New article
Past exam of the mathematics course of the University of Cambridge 2019 ib Paper 1 10G a Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
The group is a nontrivial finite p-group, so the nontrivial center of a finite p-group gives . If , then is already a nontrivial proper normal subgroup, so is not a simple group. If , then is abelian. By Cauchy's theorem for finite groups, it has a subgroup of order ; every subgroup of an abelian group is normal, and this subgroup is nontrivial and proper because . Thus in every case
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 4 9A c Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
Put and . ThenThe binomial series givessoSince , a second binomial series expansion yieldsThus the constants in the stated Big O notation expansion are
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 4 9A b Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
Let be the centre of the Earth and let be its mass. Since and , the law of cosines in triangle gives the ball's initial distance from asThe surface value of the Newtonian gravitational field satisfies . Using the Newtonian gravitational potential energy , conservation of energy now givesTherefore
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 4 9A a Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
The rod imposes a mechanical constraint, and its force is perpendicular to the wrecking ball's instantaneous velocity, so it does no work. In the constant parallel Newtonian gravitational field, the ball falls through the vertical distance . Conservation of energy between and therefore givesand hence
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 4 8E c Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
The conclusion remains true, even though the scaling factor and hence the radius may now be arbitrary. At the point where its handle meets its circle, every lollipop contains a simple triod: take a short arc of the circle in each direction together with a short segment of the handle. Pairwise disjoint lollipops therefore contain pairwise disjoint simple triods. The Moore triod theorem says that every such family in the plane is countable, so
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 4 8E b Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
Fix a positive rational radius . Distinct disjoint circles of radius have centers more than apart, so their open interior disks are pairwise disjoint. Each such disk contains a point of the countable dense set . Fix an enumeration of and assign to each disk the first rational point it contains. Disjointness makes this assignment injective, so there are only countably many circles of radius .
The positive rational numbers are countable. Taking the countable union of countable sets over all rational radii proves that the whole collection is countable.
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 4 8E a Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
A set is countable if it is finite or admits an injection into the natural numbers; equivalently, its elements can be listed by a finite list or a sequence.
The product of two countable sets is countable: after choosing enumerations, its elements are indexed by pairs , and these pairs can be listed diagonally. Thus an injection followed by an injection proves that is countable.
The integers are listed as , so is countable. Every rational number is represented by a pair , so is countable as the image of a countable set.
Finally, if are countable, choose listings , allowing repetitions for finite sets. The diagonal listing of the pairs lists every , proving that a countable union of countable sets is countable.
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 4 7E b Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
DefineCertainly . If , then and has a unique predecessor because is injective. For every , writing and using uniqueness gives ; hence and . Thus .
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 4 7E a iii by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 4 7E a ii by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 4 7E a i by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 4 6E d Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
The class of isso its size is Euler's totient functionThe unit group acts freely on every pair in : if and , multiplying the Bezout identity by gives . Hence every equivalence class has size . Dividing the answer from part (a) by this size gives
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 4 6E c Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
Assume and choose as in part (b). Put . Multiplying by and using givesSimilarly, multiplication by gives .
Moreover, is a unit modulo n: if a prime divided both and , the two congruences would make it divide , contrary to . Thus means precisely that two pairs differ by multiplication by a unit modulo . Reflexivity, symmetry using , and transitivity using products of units now show that is an equivalence relation.
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 4 6E b Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
The condition says that the ideal of generated by is all of . The multi-integer Bezout identity therefore supplies integers such thatEquivalently, first apply Bézout's identity to and then to .
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 4 6E a Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
The inclusion-exclusion principle states that for finite sets ,For each prime , exclude pairs whose two coordinates are divisible by . For a set of distinct prime divisors , exactly pairs have both coordinates divisible by their product. Inclusion-exclusion therefore gives
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 4 5E c ii by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 4 5E c i by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 4 5E b Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
We prove both identities by mathematical induction. They hold at . Assume they hold at . Using ,Adding this to and using givesThese are precisely the two assertions with replaced by , completing the induction.
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 4 5E a Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
Fermat's little theorem states that for a prime and integer ,if , equivalently . For the latter form, multiplication by permutes the nonzero residue classes modulo . Multiplying the congruences and cancelling gives . The first form also covers .
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 4 12A b Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
Apply part (a) first to the position :Applying it again to both terms on the right giveswhere because . Substituting the first formula into the last term produces
In the Earth-fixed rotating reference frame, the sideways apparent force is the Coriolis acceleration multiplied by the ski-doo's mass:At the South Pole, is vertical and antiparallel to the local outward normal, while is horizontal, soThe force points to the left of the direction of travel, which is westward when the ski-doo is moving north after crossing the pole.
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





