Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 20 6 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The abc conjecture says that for every there is such that coprime positive integers satisfy , where the radical is the product of distinct prime divisors.
The Catalan alternative yields finiteness of actual nontrivial solutions, with and . Put , so and are coprime. The triple has radical at most . Take to obtainBoth bases are bounded, and , also bound both exponents. Thus only finitely many nontrivial Catalan solutions exist under abc, the Catalan power bound from abc.
For the Fermat alternative, the usual arithmetic height statement concerns primitive solutions, or equivalently solutions modulo common scaling. A primitive positive triple is pairwise coprime, and . Applying abc to givesThis is uniform even in . If , then , so is bounded after is bounded. There are therefore finitely many primitive triples and exponents, the primitive Fermat bound from abc. Without the primitive convention, any one nonzero homogeneous solution would produce infinitely many common multiples. The Catalan proof above supplies the requested literal finiteness alternative without that normalization issue.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 20 6 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The nondegenerate power-equation problem uses fixed positive , fixed , positive integer bases, and exponents . Lower exponents are separate: is linear, while can be a generalized Pell equation with infinitely many solutions. For example has the infinite sequence generated by . The pair also persists for every exponent when , so it must be separated if exponents are to be bounded. For , the Euclidean algorithm gives a particular solution when , and all solutions follow by adding multiples of . For , put to obtain with the congruence . If is a square, factor the left side; otherwise the standard Pell reduction gives finitely many fixed-norm representatives and their fundamental-unit orbits, with the congruence selecting the allowed terms. This is an effective description even when the set is infinite.
For and sufficiently large , the equation makes and comparable, both bounded below by a fixed multiple of . Their ratio givesIf , a two-logarithm estimate has one fixed algebraic argument and one variable rational argument , of arithmetic height at most . It gives . A zero fixed logarithm is omitted, leaving the valid one-logarithm case. Therefore , effectively bounding . If , directly use ; this is either impossible or bounds both base and exponent. Cases where stays small are finite and directly enumerable.
For signed integer bases, split according to the parity of and the signs. Cases reducing to a sum of positive powers are elementary because their sum is fixed; zero or absolute-value-one bases give separately detectable constant-power families.
For each bounded , the form has distinct projective roots. The three-factor unit-equation argument of Question 5 gives an effective finite list of pairs, even if the binomial is reducible. Consequently all nondegenerate solutions can be effectively found, with the linear/Pell families and constant-base exception treated separately. This is the exponent bound for a binomial power equation.
For the polynomial generalization the precise Schinzel-Tijdeman exponent theorem is needed: if fixed has at least two distinct complex roots, solutions with integers , , and have effectively. The hypotheses cannot be dropped. The one-root polynomial gives , for every , and the two-root polynomial gives , for every .
To indicate the extension, factor over its splitting field with root multiplicities . Distinct factors have common ideal divisors only over a fixed finite collection of primes. At other primes the identity forces each root factor's valuation to be a multiple of . Ideal classes and fundamental units supply the remaining finitely specified factors. Generalized logarithmic-form estimates for these power equations control the unit terms and exceptional primes and bound those reduced exponents; since , they bound . This is why distinct roots and nontrivial perfect powers are indispensable to the asserted finiteness of exponents.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 20 4 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
In Siegel's original convention, an E-function is an entire series with coefficients in a fixed number field, satisfying a nonzero linear differential equation over , together with these arithmetic bounds: for every , all conjugates of have size , and some positive integer makes every , , an algebraic integer. A frequently used stricter convention replaces both bounds by . The original and strict growth definitions should not simply be declared equivalent; the exponential examples below satisfy the strict one.
For sums, work in the compositum of the coefficient fields. Coefficient conjugate bounds add. The product of the two common denominators clears both lists; using in each original denominator bound gives the required product bound. Finally all derivatives of lie in the sum of the two finite-dimensional derivative spaces over that rational function field, so they satisfy a nontrivial linear dependence, giving a differential equation for the sum. Thus sums are again E-functions, the addition closure of Siegel E-functions.
The Siegel–Shidlovsky theorem states that if a vector of E-functions satisfies with rational-function matrix over , then at every nonzero algebraic which is not a pole of ,In particular algebraically independent functions give algebraically independent values.
Take for algebraic numbers linearly independent over . Their coefficients are with exponential conjugate and denominator bounds, and . A polynomial relation among the functions expands into a relation among exponentials with distinct exponents and polynomial coefficients after clearing rational-function denominators; exponential-polynomial independence excludes it. At the theorem gives algebraic independence of the . For arbitrary distinct algebraic , choose a rational basis of their span and divide that basis by a common denominator. The are distinct Laurent monomials in the corresponding algebraically independent exponential values, so are linearly independent over . This recovers the general Lindemann–Weierstrass theorem. Its simplest instance uses just at nonzero algebraic .
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 20 4 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For homogeneous equations with integral coefficients , , Siegel lemma supplies a nonzero integral vector withMap the integer box to the equation values. There are inputs, while each output coordinate lies in , so there are at most outputs. Since and , the input count is strictly larger. Two inputs have the same image; their nonzero difference solves every equation and has the stated norm bound. This proves the lemma by the pigeonhole proof of integer Siegel lemma.
Rational coefficients are handled by clearing denominators. For coefficients in a number field of degree , expansion in a rational basis gives at most rational equations; if the same argument gives an integer solution with the corresponding effective bound after clearing the basis denominators. The lemma concerns homogeneous equations; arbitrary inhomogeneous integer equations need not be soluble.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 20 3 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A standard form of the Schneider-Lang theorem is this. Let be meromorphic functions with for a fixed number field . Suppose have algebraic independence over and have finite growth orders . There are at most points at which all the functions are finite and all their values lie in .
Take and , of orders zero and one. Their derivatives belong to . They have algebraic independence: a polynomial relation is impossible by exponential-polynomial independence, or by letting real tend to infinity and considering the largest .
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 20 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The Gelfond–Schneider theorem says that if is algebraic and is algebraic irrational, then every value with is transcendental. Fix such a nonzero logarithm , and suppose is algebraic. The field then contains all values needed in Schneider lattice proof of the Gelfond–Schneider theorem.
Here is an outline including the parameter balance. For a large , choose polynomial degrees , , with constants large enough that . ImposeExpand these -linear equations in a rational basis and clear denominators. Siegel lemma gives a nonzero integer polynomial with . This follows because each coefficient in the grid equations has arithmetic height and the ratio of unknowns to constraints stays bounded away from one. The exponential polynomial is not identically zero: distinct exponentials are independent over the polynomial ring, as one sees by successively applying powers of to kill all but one term.
The irrationality of makes the grid points distinct. Their zeros make subsequent grid values extremely small. More precisely, if a whole grid has been obtained, take an outer radius . Growth gives . The product form of Schwarz's lemma contributes at the next grid points. Thereforefor large initial , unless the value is zero. But every such value is algebraic in the same , since . Its arithmetic height is , so the Liouville lower bound is incompatible with the displayed upper bound for a nonzero value. Induction extends the zero grid indefinitely.
A fixed nonzero exponential polynomial has only zeros in a disc of radius , by its exponential-type growth and Jensen's formula centered at a nonzero value. The grids give distinct zeros in a disc of radius , a contradiction. Thus is transcendental for every choice of logarithm, completing the Schneider lattice proof of the Gelfond–Schneider theorem.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 2 4 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use for the basis element of the group algebra , so and . The kernel of the augmentation map is the augmentation ideal . This algebra must not initially be identified with a Laurent polynomial ring: the additive group is not abstractly generated by the integer .
For , map onto and call its kernel . It is generated by for : differences of basis elements in one coset have the form . Since each such ,by the characteristic- binomial identity. Thus .
The quotient group is a cyclic group of order , generated by the image of . Its group algebra isThe image of is and its th power vanishes, proving the reverse inclusion. HenceThis is cyclic finite quotients of the p-adic augmentation filtration.
For any , choose . The finite quotient then identifies with , a one-dimensional space generated by the image of . The degree-one symbol of consequently gives a surjective graded map , and no power of vanishes in its degree. ThusThe same finite quotients show that the I-adic completion is , and its associated graded ring is identical. The proof therefore covers the completed group algebra interpretation too, while proving the literal ordinary-algebra statement without assuming completion. Applying part ii to a ring would require its actual completeness, not just this polynomial associated graded ring.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 2 4 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A uniform pro-p group is a finitely generated powerful pro-p group whose lower p-series , has constant successive indices. For odd , the powerful pro-p group condition means , with closed generated powers understood. For it means . For finitely generated powerful pro-p groups, uniformity is equivalent to being a torsion-free group.
It is convenient to use general matrix size , then put . Let . The required kernel is , the inverse limit of its finite p-group quotients. For odd , the convergent matrix logarithm and matrix exponential seriesare inverse maps between and . The valuation bounds for ensure convergence and integrality. They give and hence a bijective power map : the unique root of is .
Direct matrix multiplication gives , so and it is a powerful pro-p group. MoreoverThe elements topologically generate: their th powers give all matrix basis directions in , since . Successive correction of each matrix entry, followed by completeness, approximates every element by words in these generators.
Its lower p-series is exactly and the indices are constant; thus the group is a uniform pro-p group. Alternatively, the logarithm excludes nontrivial p-power torsion. Setting gives a uniform pro-p group kernel of dimension and generator number , with indices . This is the odd-prime principal p-adic congruence subgroup is uniform result. The odd-prime condition matters: is nontrivial order-two torsion in .
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 2 4 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write the negative filtration as , with . Completeness is used in the separated sense ; in particular the intersection of all filtration terms is zero.
For any left ideal , its induced associated graded ideal is a left ideal of . Choose finite homogeneous generators and lift them to , with orders , meaning . Let . At each order , the leading symbol of the current residual is a sum of the generator symbols with homogeneous coefficients. Lift these coefficients to (zero when ) and subtract . The new residual lies in .
Iterating expresses as partial sums of , with residuals tending to zero. For fixed the successive coefficient increments have orders tending to infinity. Separated completeness therefore supplies . Multiplication is continuous by the multiplicative filtration, soThe sum on the right is finite, despite the convergent process used to obtain its coefficients. It belongs to the actual left ideal generated by the lifts; no assumption that is closed was made. Every left ideal is consequently finitely generated, and is a left Noetherian ring. This is the left-handed complete negative filtered-graded transfer of Noetherianity; the separated-completeness hypothesis is essential to the limiting argument.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 2 4 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let and form the Rees algebra . It is generated over by , so the Hilbert basis theorem makes it Noetherian. The Rees module is finite over it, generated by finitely many generators of the module in degree zero. Hence its graded submodulehas finitely many homogeneous generators, all in degrees at most some .
For , each degree- generator contributes a multiple from . This is contained in , because multiplication by puts its coefficient both in and in . Thus . The reverse inclusion follows directly by multiplication: it stays in and in . ConsequentlyThis is the Artin-Rees lemma, proved through finite graded generation rather than an assumption that the intersection filtration initially has that form.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 2 3 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Choose a basis of the Lie algebra and filter its universal enveloping algebra by word length: and is spanned by products of at most basis elements. The relations replace a degree-two commutator by degree one, so the degree-one symbols commute.
The Poincaré-Birkhoff-Witt theorem says the ordered monomials are a basis. Its relevant proof can be seen by reordering an inverted neighboring pair using the displayed relation. Reordering terminates because same-length terms have fewer inversions and bracket terms have smaller word length. Disjoint swaps commute; the only overlapping three-letter reorderings differ by . The Jacobi identity therefore makes the reduced ordered expression independent of the reordering path. Ordered monomials have no remaining relations and form the basis. Their degree- symbols giveFor generators of the finitely generated module , put . This is a good filtration, and is finite over the three-variable polynomial ring. Define the dimension of a filtered module as the Krull dimension of its associated graded module, equivalently the degree of the eventual cumulative polynomial , or the Gelfand–Kirillov dimension of a module. Two good filtrations have bounded shifts, so the growth degree is independent of the generators. Sinceits polynomial degree is at most three. Therefore every nonzero finitely generated -module has dimension at most . The zero module may be assigned the usual separate empty-support convention. This bound also follows immediately from its support of a module inside affine three-space.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 2 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Whenever the graded pieces are finitely generated over , define the Poincare series of a graded module byAdditivity means for every short exact sequence in the indicated category. Dimension over a field is a basic example; length is another when the modules have finite length.
The Hilbert-Serre theorem needs finite-generation hypotheses: take commutative Noetherian and generated over it by homogeneous of positive degrees . For finitely generated graded , every is then finite over , andIf negative grading indices are allowed for the module, the numerator is a Laurent polynomial instead. In standard degree one, the coefficients are eventually polynomial functions of the index.
To prove this, regard as finite over the surjective polynomial presentation . Induct on . At only finitely many homogeneous generator degrees occur, so the series is a polynomial. For the last variable of degree , put and . The polynomial ring is Noetherian by the Hilbert basis theorem, hence is finite; both and are finite modules over the ring with that variable removed. The degree- exact sequence isAdditivity, followed by summing over , givesThe induction hypothesis supplies the remaining denominator factors. This proves Hilbert-Serre theorem for an additive coefficient function. If all , expanding proves eventual polynomial coefficients directly.
An arbitrary positively graded ring in the introductory wording is not enough by itself. For example with every variable of degree one and is a cyclic graded module, but is not finite-dimensional over , so the dimension-valued series is not even defined. The theorem above states the standard hypotheses that make the requested definition and rationality valid.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 2 1 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For a noncommutative domain , the right Ore condition on its nonzero elements requires that for every and nonzero , there exist and with . The Ore theorem says that this is precisely the condition for a division ring of right fractions in which embeds and every element is . The left-handed condition similarly gives left fractions.
For completeness, a right Noetherian domain satisfies the condition. If with , the right idealsform a strict chain of direct sums. Indeed, in a relation , the first term lies in and the rest in . Their zero intersection makes , hence ; cancel and repeat. Every new summand is nonzero in a noncommutative domain, contradicting the ascending chain condition. Thus exists, with , giving right common multiples. The opposite-ring argument gives left common multiples when is a left Noetherian ring. This proves right Noetherian domains satisfy the Ore condition.
A sketch of the fraction construction also explains the theorem. Pairs represent . They represent the same fraction when a common right denominator also satisfies . Addition uses . For multiplication choose with ; thenFurther common denominators prove well-definedness and the ring identities. The original map is injective because all nonzero denominators are regular; a zero fraction numerator would satisfy for . Every nonzero fraction has inverse , so the ring is a division ring. This construction has the universal property of inverting all nonzero elements.
Apply this to the two-sided Noetherian noncommutative domain . Its left Ore property expresses any right fraction as a left one: choose with , yielding . Hence one division ring is simultaneously the left and right classical ring of quotients of ; the two constructions agree by their universal property.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 2 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The commutative Laurent polynomial ring is an integral domain and is invertible. Write nonzero elements asThe largest exponent in their product is , with coefficientThere is only one pair of exponents contributing at this degree, and the coefficient cannot vanish in the integral domain . Hence . Equivalently, forces or . This is skew Laurent extensions of domains are domains, and the argument works over the original field in any characteristic.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 2 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Put , and . The multiplication of matrix-coordinate triples is . In particular is central, , and every element has the unique normal form . ConsequentlyThe distinct normal-form monomials are the group basis, so this is an isomorphism, not merely a surjection from a presented algebra. This is the integral Heisenberg group algebra as a skew Laurent ring.
Here is the needed skew Hilbert basis theorem, including its proof. If is a left Noetherian ring and an automorphism, let be a left ideal of , where . DefineThese are left ideals of : adding lifts adds the coefficient, and left multiplication by multiplies its normalized value by . Multiplication of a lift by proves . The chain stabilizes at some . Choose finite generators for each , , and lifts with coefficient .
For of degree , write its normalized leading coefficient as . Thenhas smaller degree: the displayed summands have leading coefficients . For use the generators for without the shift. Induction on degree expresses every element of in terms of the finitely many chosen lifts. Thus is a left Noetherian ring. Passing to the opposite ring replaces by and proves the corresponding right-sided result.
This proof includes the ordinary Hilbert basis theorem when is the identity. Starting with the field , it makes Noetherian; localization at powers of makes Noetherian as well. Finally, for a left ideal in , its intersection with has finitely many generators. For each , some lies in , so is generated by those same elements in the skew Laurent polynomial ring. Right multiplication clears powers for a right ideal. Therefore is a left Noetherian ring and a right Noetherian ring.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 19 3 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
We prove that the only finite-order rational point is the origin: . The identity always has order one, so “no elements of finite order” must be understood as no nonidentity torsion points.
The given discriminant is a unit at and , so the integral Weierstrass equation of an elliptic curve has good reduction at both primes. For an odd prime , completing the square in shows that the number of above is determined byA nonzero quadratic residue gives two points, zero gives one, and a nonresidue gives none. Direct evaluation givesIncluding the origin gives and .
At a good prime , reduction is injective on torsion of order prime to : a point in its kernel belongs to the formal group, where multiplication by that order is bijective by part(i), so a point killed by it must be zero. Suppose a nonidentity rational point has finite order. Taking a suitable multiple gives a point of prime order . If , reduction at both primes forces to divide both and , impossible. If , reduction at forces , impossible. If , reduction at forces , also impossible. This exhausts all primes and proves the claim. The torsion exclusion from good reduction counts explicitly handles the two residual characteristics instead of incorrectly assuming prime-to- injectivity also controls -torsion.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 19 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let be finite, with ring of integers and maximal ideal . The formal group of an elliptic curve on an integral Weierstrass model is a formal group law , and denotes its points with parameter in . Its multiplication series isSince , the linear coefficient is a unit. Construct a compositional inverse recursively: at degree , the coefficient of in is , so the equation making that degree vanish uniquely determines . The inverse on the other side is the same series, by uniqueness of formal composition inverses.
Both series converge on , since their coefficients are integral and powers of an element of tend to zero. Their formal identities therefore hold as identities of convergent values. Thus for every there is a unique with , andThis proves unique divisibility for every finite extension, including ramified extensions and negative . It uses prime-to-residue-characteristic multiplication on a formal group, not an unjustified logarithm isomorphism on the entire maximal ideal.
Now assume good reduction of an elliptic curve. For a finite local extension , the reduction sequence isProperness defines reduction for all points, smoothness and the Hensel lemma make it surjective, and its kernel is precisely the formal group. Let be the maximal unramified extension and take . Its coordinates lie in a finite unramified extension . Over the algebraic closure of the residue field, the isogeny is surjective, so choose with . This residue point is defined over a finite residue extension. Choose the corresponding finite unramified extension inside , and lift it to by smooth reduction.
Then lies in the reduction kernel. The first argument gives a unique kernel point with . Hence satisfies . ConsequentlyEvery lifting and convergence argument was made in a finite complete extension; itself need not be complete. Unique divisibility is asserted only for the formal group. For , good reduction also lifts the prime-to- torsion, so has nonzero -torsion and division there is not unique. The construction is unramified division points at good reduction.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 19 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
There is a necessary ordering qualification: the printed formula requires the even leg to be called . The primitive Pythagorean triple satisfies the printed hypotheses but cannot have . Thus the intended assertion is true after interchanging the two legs if necessary. We prove that version, including the parity condition on the parameters.
A primitive Pythagorean triple has pairwise coprime sides: a prime dividing any two also divides the third. The two legs cannot both be odd, since their squares would sum to , and cannot both be even. Call the odd leg and the even leg ; then is odd. The positive integerssatisfy and are coprime, since a common divisor divides both and . A product of coprime positive integers is a square only when both factors are squares, by their prime factorizations. Write , . Then , , andFurthermore have opposite parity, since is odd. Conversely these coprimality and parity conditions give a primitive triple: the square identity follows by expansion, and a common odd prime divisor of its legs would divide both , while the odd leg excludes a common factor two. This is the primitive Pythagorean parametrization.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 18 1 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
We prove the reverse-inclusion well-quasi-ordering of monomial ideals, equivalently of all upward-closed subsets of , by induction on . For the sets are tails and the empty set; reverse inclusion orders their endpoints as , a well-order. The case , if needed for the induction, is just a finite family.
For an upset , let . These are upsets of and satisfy . They stabilize. Indeed the union has a finite minimal basis by Dickson's lemma: an infinite set of minimal elements would be an antichain in the componentwise well-quasi-ordering of . Each basis element appears in some slice, and after the largest of these finitely many indices the slice contains the entire upset .
Choose a stabilization index , and encode by the finite word and the final slice . The induction hypothesis makes slices a well-quasi-ordering by reverse inclusion. Higman's lemma, proved in Question 3 below, makes their finite words a well-quasi-ordering; finite product closure of well-quasi-orderings also compares the final slices. Thus in every infinite sequence of upsets there are earlier and later with a strictly increasing matching of the earlier pre-stabilization slices into the later ones, such thatSince and the -slices increase, for . For , . Therefore , completing the induction.
Now choose one finite support for each term of an arbitrary infinite sequence in the finitely generated incline. The result supplies with , and the preceding absorption calculation gives . Hence every finitely generated incline is well-quasi-ordered by the specified reverse absorption order. The proof allows all additional algebraic identifications among the generators.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 18 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Suppose the incline is generated by . Repeated distributivity, followed by commutativity and additive idempotence, expresses every element as a finite nonempty sumNo multiplicative identity is assumed: a zero exponent means that the corresponding generator is omitted, and every displayed monomial has at least one factor. Different supports may represent the same element; uniqueness is unnecessary.
Associate to its upward-closed exponent setIf , each monomial of is either equal to, or a multiplicative extension of, a monomial of . It is absorbed by that earlier monomial, and hence by the full sum . Adding the terms of one at a time givesFor equal exponent vectors the first absorption is additive idempotence; for strictly larger vectors it is the incline's multiplicative absorption. Thus the issue is to prove that exponent upsets are well-quasi-ordered by reverse inclusion, not merely to apply Dickson's lemma to individual exponents.
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





