Mathematics Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2005 ia Paper 2 2B Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2017 ia Paper 1 1A a Solution Created 2026-09-24 Updated 2026-10-03
By Euler's formula, . Factoring out the half-angle givesSince , the cosine is positive. ThereforeOn the Argand diagram, the points form a rhombus. Its diagonal from to bisects the angle between the unit vectors and , so its direction is ; resolving either side along the diagonal gives its length .
Past exam of the mathematics course of the University of Cambridge 2020 ia Paper 1 1C i Solution Created 2026-09-24 Updated 2026-09-29
Past exam of the mathematics course of the University of Cambridge 2022 ia Paper 3 7E Solution Created 2026-09-23 Updated 2026-09-25
A subgroup is normal whenIts left and right cosets then agree, and multiplicationis well defined on the cosets. The identity is , the inverse of is , and associativity descends from , so these cosets form the quotient group .
For a group homomorphism , its kernel and image areThe kernel is normal becausewhenever . Conversely, if , the quotient mapis a homomorphism with kernel . The image of any homomorphism is closed under products and inverses, so it is a subgroup of . Finally, the mapis well defined and bijective and preserves multiplication. This is the first isomorphism theorem.
DefineEuler's formula shows that is a homomorphism, its image is the complex unit circle, and its kernel is . The first isomorphism theorem therefore givesThe image of consists exactly of the roots of unity: if , then , while every element of finite order on the unit circle has an argument that is a rational multiple of .
Past exam of the mathematics course of the University of Cambridge 2022 ii Paper 1 17F c Solution Created 2026-09-24 Updated 2026-09-25
Euler's formula for a connected plane graph is . If the graph is triangle-free, every face has boundary length at least four, soEuler's formula then gives , so the average degree is less than four. There is a vertex of degree at most three. Delete it, color the remaining graph inductively with four colors, and restore it using a color absent from its at most three neighbors. Thus
Past exam of the mathematics course of the University of Cambridge 2023 ib Paper 3 14A c Solution Created 2026-09-24 Updated 2026-09-25
Using Euler's formula and the Inverse Fourier transforms of phase factors,andThese are distributional identities, with the Dirac delta function.
Past exam of the mathematics course of the University of Cambridge 2023 ii Paper 2 41C d Solution Created 2026-09-24 Updated 2026-09-25
Using Euler's formula,ThusOrdering the modes as , let . ThenConsequentlyThis matrix is triangular, so its eigenvalues are its diagonal entries: