Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the number theory course of the University of Oxford 2008 B 8 Solution by
Codex 0 2026-10-31
For integral solutions of x squared minus two equals y cubed, the equation implies , so . If were even, then would be even and would be two or six modulo eight, whereas would be zero modulo eight. Thus and are odd. Also : otherwise , which is not a cubic residue modulo nine. Reducing modulo three then gives . ConsequentlyPut and . Its field norm is . The principal ideals and are coprime. Indeed a common prime ideal has underlying rational prime dividing . The displayed gcd excludes two and three, so both two and are invertible modulo that prime ideal. The difference therefore implies , contradicting .
Their product is , so unique factorization of ideals in a number field and coprimality imply for an integral ideal . In the given ideal class group of order two, implies . Hence with integers . Equality of principal ideals gives . The only units are , and both are cubes, so the sign can be absorbed into . Taking norms, and using , givesThe coefficient of gives . Eliminating with the field norm identity yieldsThe denominator is nonzero for integral . Polynomial division makes the integrality obstruction especially clear:If is integral, the reciprocal must be an integer, forcing . The only integral possibility is . Then , the field norm gives , and the real coefficient in the cube gives . Both pairs directly satisfy the original equation. Therefore all integral solutions are
Past exam of the number theory course of the University of Oxford 2008 B 7 Solution by
Codex 0 2026-10-31
Choose a nonzero integral ideal whose class is ; one can multiply the fractional inverse by a suitable nonzero integer to obtain such a . By the given bound choose with . Put . Since , multiplication by makes an integral ideal. Its class is , and multiplicativity of ideal norms givesThis proves the class representative bound without accidentally constructing a representative of the inverse class instead.
To determine the Ideal class group of Q of square root minus thirty-four, write . The given integral basis has discriminant , so the imaginary-quadratic bound is . Every class therefore has a representative of ideal norm at most seven, and factoring such representatives shows that the ideal class group is generated by prime ideals of ideal norm at most seven.
Two ramifies: let , with . Three is inert because is irreducible modulo three, so its prime ideal ideal norm is nine and supplies no small generator. At five and seven the roots are , so the primes of ideal norm five and seven are conjugate pairs. Set and . Their conjugates have inverse ideal classes. No new prime ideal has ideal norm four, since the only prime above two has residue degree one; six is not a prime power. Thus generate the ideal class group.
The element field norms and , together with reduction at the split primes, giveThe ideal norm products verify both exponents. Consequently and , so the whole group is generated by and its order divides four. The class is not trivial: a generator would be an element of the ring of integers of field norm two, but has no integer solution. Since , its order is exactly two. Hence has order four and
Past exam of the number theory course of the University of Oxford 2008 B 6 Solution by
Codex 0 2026-10-31
The Dedekind factorization theorem says: if with integral, minimal polynomial of an algebraic element , and the rational prime does not divide , factor into distinct monic irreducibles over . Then the distinct prime ideals above are , with integer lifts , andThe index condition is part of the theorem and must be checked before applying it at a ramified prime.
For this cubic, is Eisenstein and has discriminant . We first verify . The square of the index divides 972, so only two and three can divide the index. If either prime divided it, the finite quotient group would contain an element of order , giving an integral element with digits , not all zero. Its field norm isFor , the numerator has valuation zero if , valuation one if , and valuation two if . For the same three cases, according to the first nonzero digit, give valuations zero, one and two. None gives an integer field norm after dividing by , contradicting integrality. Thus the index is one.
Multiplication by in the power basis, or the product over the three conjugates, gives . DefineReduction of the cubic gives at two and three, at five, and at seven. The quadratic factor at five is irreducible since its discriminant is two, a nonsquare modulo five. HenceThe norms are respectively . Norms and reduction of the elements at those primes giveFor example their absolute element field norms are ; each indicated prime divides the element by substitution in its residue field, and the product of the indicated ideal norms already equals that absolute field norm. Thus no additional factor or exponent is possible.
In the ideal of the specified quotient every prime exponent cancels:Equality with the unit ideal implies that both and its inverse are integral, so . For the real root, . The numerator is negative and has absolute value less than two, while the denominator is greater than five. Thus , proving . Its field norm is , consistent with the ideal calculation.
Past exam of the number theory course of the University of Oxford 2008 B 5 Solution by
Codex 0 2026-10-31
For the basis , its discriminant isEquivalently it is the square of the determinant of the matrix of the embeddings applied to the basis vectors. It is nonzero because number fields are separable. An integral basis is a basis of the ring of integers as a free abelian group; in particular it is a rational basis of the field and expresses every algebraic integer uniquely with integer coefficients.
To prove existence, start with any rational basis and multiply each vector by a suitable nonzero integer to make it integral. This is possible by clearing coefficients in its monic rational minimal polynomial of an algebraic element and rescaling the variable. Let be the lattice spanned over by these integral vectors, and let be its discriminant. For any algebraic integer , each trace is an integer. The resulting linear system has integral coefficient matrix with determinant . Its adjugate matrix shows . ThusA subgroup of a finitely generated free abelian group is free and finitely generated. Here its rank is , since it contains and is contained in a rank- lattice. Its free generators are the required integral basis.
For squarefree , the quadratic integral basis isThe source allows squarefree nonzero integers, so the degenerate value gives and basis instead of a two-element basis.
In the biquadratic field define the three automorphisms by changing respectively the sign of , the sign of , and both signs. Their actions areHence the three sums are , and . If is integral, each sum is integral and lies in its displayed quadratic subfield. Their radicands are squarefree and respectively congruent to two, three and two modulo four. The quadratic basis formula therefore forces all their two coefficients to be integers, proving
Past exam of the number theory course of the University of Oxford 2008 A 4 Solution by
Codex 0 2026-10-31
A straightedge and compass construction uses finitely many steps drawing lines through known points and circles with known centres and constructible radii, and adjoining their intersection points. The coordinates obtained by line–line intersections require only field operations; line–circle and circle–circle intersections require at most a quadratic extension after eliminating a linear equation. Thus all coordinates lie in a tower of quadratic extensions of the initial coordinate field. The degree of any finite intermediate coordinate field containing that initial field divides a power of two and is therefore for some .
For the source's notation this assumes , as is customary when previously constructed points are retained. If only the coordinates of a final subset are called , replace it by the compositum ; otherwise the expression need not be defined. The power-of-two condition is necessary and is not being asserted as sufficient for an arbitrary algebraic number.
Starting from a unit cube, doubling its volume would construct a length . Its polynomial is Eisenstein at two, so its degree over is three, which cannot divide a power of two. Thus doubling the cube is impossible by ruler and compass.
Set , . The real part of is . Replacing by givesChoose the given angle to have cosine . It is constructible, since its unit circle point has coordinates . If a fifth of that angle were constructible and had cosine , the identity would implyThis polynomial is Eisenstein at five: all nonleading coefficients are divisible by five and the constant term is not divisible by 25, while 96 is not divisible by five. Hence . But the initial angle field is , itself of degree two, so adjoining any finite collection of constructible coordinates to it would still give total degree over a power of two. It could not contain a degree-five element. Thus general angle quintisection is impossible with straightedge and compass.
Past exam of the number theory course of the University of Oxford 2008 A 3 Solution by
Codex 0 2026-10-31
A finite extension is Galois when it is both normal and separable; over separability is automatic, so it is equivalently a splitting field of a polynomial with distinct roots. Its Galois group consists of the field automorphisms fixing . If , the Fundamental theorem of Galois theory gives mutually inverse inclusion-reversing bijectionsThey satisfy and . The intermediate extension is Galois exactly when is normal, and then via restriction.
Every permutation of the four roots permutes the three unordered partitions into two pairs and hence permutes the three . Thus each coefficient of is a symmetric polynomial in the four roots. The Fundamental theorem of symmetric polynomials expresses it in the elementary symmetric functions, which are rational coefficients of . Hence . Each product , , occurs exactly twice in , so that sum is . Therefore the quadratic coefficient is .
For the given cubic write . The translated cubic is Eisenstein at three, hence irreducible. It has one real root and a nonreal conjugate pair. Its Galois group is transitive on three roots, so its order is divisible by three; complex conjugation is a transposition. A subgroup of with both a three-cycle and a transposition is all of . HenceLet . Irreducibility of the quartic makes the root action transitive, so four divides . The cubic splitting field lies inside by the definitions of the , and restriction onto its Galois group gives a quotient of order six. Thus six also divides . Since divides 24, it is 12 or 24. If it were 12, the supplied index-two result would give . The restriction kernel would then be a normal subgroup of of index six, contrary to the other supplied result. Thus
Past exam of the number theory course of the University of Oxford 2008 A 2 Solution by
Codex 0 2026-10-31
Every automorphism fixes zero and one, and preserves sums, products, negatives and multiplicative inverses of nonzero elements. Consequently elements fixed by every member of are closed under these operations and form a field. Artin fixed-field theorem gives for a finite automorphism group.
Here is the fraction field of , with transcendental; its elements are fractions of rational-coefficient polynomials, with nonzero denominator and the usual equality by cross-multiplication. Substitution of or defines an automorphism, each its own inverse. With meaning first apply to a field element and then , its image on is . Iterating gives and then , so its order is three. The relations reduce every word to at most six possibilities, and the six resulting images areThey are distinct rational functions, so the group has six elements. Its faithful permutation action on identifies it with .
For the first fixed field put . It is fixed by , and satisfies over . The degree is exactly two because the nontrivial automorphism fixes that field. The fixed-field degree is also two, soFor the inversion put . It is fixed and satisfies . The same degree argument givesThe source requests polynomial generators in both cases. The second requirement is impossible. If a nonconstant polynomial were fixed by inversion, would equate a Laurent polynomial with highest exponent to one with no positive exponent, a contradiction. Thus the only polynomial invariants of inversion are constants, which cannot generate its nonconstant fixed field. The fixed field of inversion in a rational function field therefore has the second displayed rational-function generator.
Past exam of the number theory course of the University of Oxford 2008 A 1 Solution by
Codex 0 2026-10-31
For an irreducible polynomial , take and let be the class of . The quotient is a field, is generated by over , and satisfies . Its degree is , with basis .
A splitting field is a field generated over by all roots of the polynomial and in which the polynomial is a product of linear factors. Prove existence and the factorial bound together by induction on the degree. Constant nonzero polynomials and linear polynomials require no extension. For a reducible degree- polynomial write with positive degrees . Split by induction, then split over that field. The resulting field is generated by all roots of , and its degree over is at most . If is irreducible, adjoin one root in degree , divide out its linear factor, and split the degree- quotient over that extension. The tower formula gives degree at most . This also works in inseparable characteristic and proves the required bound without assuming Galoisness.
For the sextic with constant term three, Eisenstein's criterion at three gives degree six. Choose a root , so is a square root of . Thensatisfies , and is a primitive sixth root of unity: and . The six distinct roots are for , all in . Hence the simple extension is itself the splitting field and .
For the constant term two, Eisenstein at two gives for a root . Its splitting field is . The supplied noncontainment of a root of means that adjoining has degree two. Thus
Past exam of the number theory course of the University of Oxford 2007 B 8 Solution by
Codex 0 2026-10-31
Work in , since . First must be odd: if it were even, coprimality would make odd, so , which cannot be an odd power for . Thus is odd too. Also no odd prime can divide both and . Such a prime does not divide , and square-freeness of gives , whereas is divisible by . Hence .
Put . Suppose a prime ideal divides both and , and let be the rational prime below it. It then contains and . The case is impossible because is odd. If is odd, the first inclusion gives , and makes nonzero in the residue field. The second inclusion therefore gives , so , contradicting the previous paragraph. Thus and are coprime ideals. In particular they generate the unit ideal, the precise meaning of coprimality here; no unique factorization of elements is assumed.
Their product is . Unique prime ideal factorization and disjoint prime support imply for an integral ideal . In the ideal class group, . Since does not divide the class number, Lagrange's theorem forces . Write . Equality of the principal ideals gives . The only units are , since a unit satisfies and . Both signs are th powers for odd , so they can be absorbed into the generator:Apply the class-number obstruction from a ramified odd exponent. For the equation with and , compare the coefficients of in this identity. The coefficient on the right isIts term is divisible by , and every term contains a factor , so the whole coefficient is divisible by . The coefficient on the left is one, a contradiction. Thus there are no positive integer solutions under the stated class-number and divisibility assumptions.
Past exam of the number theory course of the University of Oxford 2007 B 7 Solution by
Codex 0 2026-10-31
Minkowski convex body theorem states that a centrally symmetric convex measurable subset of with volume greater than times the covolume of a full Euclidean lattice contains a nonzero lattice point. The equivalent closed-boundary form follows by compactness for compact convex bodies.
The set is centrally symmetric. It is convex because for , the triangle inequality gives . It is a diamond of area . For the embedded nonzero integral ideal , the given covolume is . Hence Minkowski convex body theorem applies whenFor the resulting nonzero , write , . ThenDecrease to . A fixed slightly larger diamond contains only finitely many lattice points, so one nonzero recurs along a sequence of such values. Passing to the limit provesGiven a target ideal class , choose an integral ideal in . Since , the ideal is integral, belongs to , and has ideal normFor , every ideal class thus has an integral representative of norm at most . The only possibilities are norms one, two or three. The prime two ramifies, giving the unique ideal of norm two . The element has field norm , so , making it principal. The prime three is inert because is an irreducible polynomial; its prime ideal has norm nine, so there is no ideal of norm three. Every possible small representative is principal, proving class number one for Q square root of fourteen. Therefore
Past exam of the number theory course of the University of Oxford 2007 B 6 Solution by
Codex 0 2026-10-31
Dedekind factorization theorem states that if with integral and does not divide , then a factorization of its minimal polynomial of an algebraic element into distinct monic irreducible polynomials over givesThe factors are distinct prime ideals; the residue degrees and ramification indices satisfy . Unique prime ideal factorization holds in the ring of integers.
For a square-free integer , , so the index condition is automatic. If , the polynomial reduces to modulo . HenceTherefore . By unique prime ideal factorization, .
Let be a nonempty proper subset and put . For , and is a square-free integer. If , its ideal norm givesThe inequality forces , leaving , impossible for a square-free integer greater than one. Thus every such subproduct is nonprincipal.
These are ramified prime classes for discriminant minus four d. The ideal classes have order dividing two. Their product is the identity, and the preceding proof rules out every other nonempty subset relation. The homomorphism defined by these classes consequently has kernel exactly . Its image is thereforeThe boundary case has and makes the printed exponent meaningless; its field is with trivial ideal class group. The subgroup statement is understood for , while the prime-factor and proper-subset statements are empty for .
Past exam of the number theory course of the University of Oxford 2007 B 5 Solution by
Codex 0 2026-10-31
For the distinct complex embeddings of the number field, define the discriminant of elements of a number field byThe equality follows by multiplying the transpose of the embedding matrix by itself. Each field trace is rational: it is also the trace of the rational matrix of multiplication by on . Thus the determinant lies in . If the are algebraic integers, the products and their conjugates are algebraic integers, and so are their sums. A rational algebraic integer is an integer, hence all trace entries and their determinant are integers.
Write . The inclusion of the generated abelian groups makes an integer matrix. Its embedding matrix is the embedding matrix of the multiplied by . Taking squared determinants givesFor independent algebraic integers , choose an integral basis of . The same formula gives . If is nonzero and a square-free integer, the integer index must be one, proving that the form an integral basis.
Now put . Since has degree three, the monic polynomialis its minimal polynomial of an algebraic element. The field norm is the negative of its constant term:For the discriminant calculation, . In the basis , using , multiplication by this element has matrixThus the given derivative-norm formula gives . Since satisfies a monic polynomial with integer coefficients, are algebraic integers; the fact that a squarefree discriminant certifies an integral basis proves
Past exam of the number theory course of the University of Oxford 2007 A 4 Solution by
Codex 0 2026-10-31
A finite straightedge and compass construction repeatedly draws the line through two available distinct points or the circle with an available center and an available distance as radius, and adjoins isolated intersections of two such lines or circles. A finite set is constructible when its points occur after finitely many such steps, starting with the specified points.
If the current coordinate field is , intersections of two lines solve linear equations over . A line and a circle lead to a quadratic equation over . For two distinct circles, subtraction of their equations gives a line, reducing to the previous case. Thus each step adjoins coordinates in an extension of degree one or two. The tower law gives a finite tower of quadratic-or-trivial field extensions containing all output coordinates. If the final coordinate field contains , thenbecause its degree divides the power-of-two degree of that tower.
Two implicit qualifications are necessary for this degree statement. The output is obtained in finitely many steps; the aggregate of infinitely many individually constructible points need not generate a finite extension. Also, unless the output retains the original coordinates, need not contain . In that case the degree statement applies to the compositum , rather than an undefined . The heptagon application explicitly includes , so neither issue obstructs it.
Here , and a vertex adjacent to has first coordinate , so . Let . The cyclotomic polynomial is irreducible, giving . Since , it satisfies over . The element is nonreal while , so this relative degree is exactly two. By the tower law,If the regular regular heptagon were constructible, this degree would divide , impossible. Therefore the regular heptagon is not constructible from the given unit segment.
Past exam of the number theory course of the University of Oxford 2007 A 3 Solution by
Codex 0 2026-10-31
Put . Then , so is a root ofThis polynomial satisfies Eisenstein's criterion at : every nonleading coefficient is divisible by , while the constant coefficient is not divisible by . ThereforeNow suppose , taking without loss of generality. Let . Since and ,Consequently all four distinct roots lie in this field. This gives a cyclic quartic field from a nested quadratic radical. It is a splitting field in characteristic zero, hence a normal extension and a Galois extension.
There is a Galois automorphism sending to : a root image defines an embedding, and normality makes it an automorphism of the splitting field. It sends to , soThus is a four-cycle. The Galois group has order four and contains an element of order four, givingFor the requested lower degrees, gives and degree two; gives and degree one. Both pairs use positive integers.
Past exam of the number theory course of the University of Oxford 2007 A 2 Solution by
Codex 0 2026-10-31
An algebraic element is a separable algebraic element over if its minimal polynomial of an algebraic element has distinct roots in a splitting field. A field extension is a separable extension if all its elements are separable algebraic elements.
The formal derivative is additive and satisfies . For monomials, . Distributing over the finitely many coefficients proves the product rule over any field. If in an extension, the rule gives , so , including in characteristic two. If were relatively prime in , the Bézout's identity for polynomials would give , whose evaluation at is impossible. Hence they are not relatively prime.
In characteristic zero, the formal derivative of a positive-degree irreducible polynomial is nonzero and has smaller degree. Thus , since an irreducible polynomial has no proper nonconstant factor. By the previous argument, has no repeated root. Every element of a finite field extension is algebraic, so the extension is a separable extension.
For , let . The characteristic- identity gives , so is already a splitting field. It is a proper extension by the allowed no-root fact. More precisely, the minimal polynomial of an algebraic element divides and, over , equals for some . If , its next-to-leading coefficient is , forcing because in , a contradiction. Hence its minimal polynomial of an algebraic element is , with its one root repeated times. The extension is therefore inseparable, of degree .
By contrast, every finite field extension is a separable extension. If , then . Lagrange's theorem in its nonzero multiplicative group gives for all . Thus every element is a root of , whose formal derivative is ; it has no repeated roots. Every minimal polynomial of an algebraic element divides this separable polynomial, proving the assertion.
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





