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 2016 iii Paper 126 5 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Work initially with , where the nonholomorphic Eisenstein series and its differentiated series converge locally absolutely. For , the identitiesshow that each summand at becomes the summand indexed by at . Reindexing the nonzero integer pairs therefore provesHere and the denominator powers use logarithms of positive real numbers, so there is no ambiguity for complex .
For the nonnegative Laplace-Beltrami operator of the hyperbolic plane, . If with primitive and , choose a matrix in with bottom row . The corresponding summand isThe Laplace-Beltrami operator commutes with hyperbolic isometries, so this summand has eigenvalue . This also covers , or follows there directly. Termwise differentiation now givesThe equation describes an automorphic eigenfunction; it does not assert that this noncuspidal function belongs to the square-integrable discrete spectrum.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 125 4 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Galois cohomology records the obstruction to choosing Galois-invariant division points. Let be the absolute Galois group and give its algebraic-point modules the discrete topology. A continuous -cocycle with values in a Galois module is a function satisfyingA group coboundary has the form . Quotienting cocycles by coboundaries defines . For the finite module these cocycles have finite image and factor through finite data; continuity is essential because is a profinite group.
In characteristic zero, multiplication by on the algebraic points of an elliptic curve is surjective, with kernel . The short exact sequence of Galois modulesgives the Kummer exact sequence of an elliptic curveExplicitly, choose with and set . Changing by an -torsion point changes the cocycle by a coboundary. The class vanishes exactly when a suitable choice of is Galois-fixed, that is, when . This proves the injection directly and identifies its arithmetic meaning.
The entire group need not be finite. For example, Kummer theory gives , which has classes supported on arbitrarily many different primes. The finite part needed for the Weak Mordell-Weil theorem comes from a ramification restriction on the image of .
Choose a finite set of places containing the archimedean places, the primes dividing and all primes of bad reduction of an elliptic curve. At a finite place , the curve has good reduction and is invertible in its valuation ring. The elliptic curve extends to a smooth proper group scheme, and on that model is finite etale. A point extends to an integral section by properness. Its division-point fibre is consequently finite etale over the valuation ring. Over the maximal unramified extension it has a point, so the Kummer cocycle restricts trivially to the inertia group. The module itself is unramified there for the same reason. Thuswhere denotes classes unramified outside .
Here is a proof that this restricted group is finite. Take a finite Galois extension containing all coordinates of and the th roots of unity, and enlarge by its ramified primes. Over the module is trivial and, after choosing a basis, is isomorphic to . Hilbert theorem 90 and the multiplicative Kummer sequence therefore giveFor unramified Kummer classes with bounded prime support, a class unramified outside has valuations divisible by at every prime outside : the valuation of an th root in an unramified extension is integral. Consequently both coordinates lie in
To show this set finite, write the outside- divisor of as . The ideal class of belongs to the -torsion of the ideal class group of the ring of -integers. This gives the exact sequenceThe last map is onto: if is principal in the -ideal group, a generator represents a class with outside valuations divisible by . The kernel consists exactly of S-units modulo th powers. The Dirichlet unit theorem, with the finitely many inverted primes adjoined, makes the S-unit group finitely generated; the ideal class group is finite, and localization only quotients it. Both ends of the sequence are therefore finite.
Finally, the inflation-restriction exact sequence bounds the kernel of restriction from to by the finite group . The unramified subgroup has finite image, contained in , and finite kernel, so it is finite. The Kummer injection now provesThis is the Weak Mordell-Weil theorem, proved without first assuming finite generation of .
For computation one refines the unramified group by local solvability. The Selmer group of an elliptic curve consists of classes whose restriction at every completion lies in the corresponding local Kummer image. It is finite and sits inwhere the Tate–Shafarevich group measures classes in that become trivial at every completion. Thus locally soluble descent equations can give an upper bound without every class coming from a rational point. No finiteness assumption on the whole Tate-Shafarevich group is needed for the weak theorem. Combining the finite quotient with the height descent lemma from the height essay yields the full Mordell-Weil theorem. Replacing multiplication by with a smaller isogeny gives the same cohomological framework for two-isogeny descent.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 125 4 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Heights measure arithmetic size, and their finiteness and growth properties turn finite divisibility information into finite generation. For an elliptic curve over a number field , the resulting Mordell-Weil theorem isThe distinction between this statement and the Weak Mordell-Weil theorem, which only asserts that is finite, is exactly where heights enter.
For a rational point of the projective line, choose coprime integers and define the logarithmic projective heightFor a fixed number field, its absolute logarithmic version iswith the usual normalized absolute values. The product formula makes this independent of scaling , and the local degree formula makes it independent of enlarging the number field. Heights are nonnegative and are useful precisely because they control numerator and denominator together, unlike an ordinary real absolute value.
The Northcott theorem states that algebraic points of bounded degree and bounded height form a finite set. Over this is immediate from the coprime numerator-denominator description. In general, bounded degree and height bound the coefficients of the primitive minimal polynomial: their elementary symmetric functions are bounded by its Mahler measure, which is the appropriate power of the multiplicative height. There are only finitely many such integer polynomials.
On a Weierstrass equation of an elliptic curve, define the naive logarithmic height and . Since an -coordinate has at most two points above it, Northcott theorem implies that only finitely many points of have bounded .
Duplication descends to a rational map of the projective -line of degree . More generally, if a morphism has degree , thenuniformly in . Write as two homogeneous degree- polynomials without common zeros. Bounding their coefficients gives the upper estimate at each place. A nonzero resultant, or homogeneous Bezout identities, prevents simultaneous cancellation and gives the lower estimate; only finitely many places contribute a nonzero constant. Applied to duplication, this gives the height growth under a morphism of the projective line estimate
Define the canonical height of an elliptic curve byThe factor is a convention making it the height for the degree-one symmetric divisor . If , then , so the limit exists by a geometric-series estimate. Summing that estimate also provesThus bounded canonical height still gives only finitely many -points, and exactly.
The addition formula on the quotient by negation gives the uniform approximate parallelogram identityThis height parallelogram identity follows as follows. One way to obtain it is to express the unordered pair of their -coordinates as a morphism of bidegree ; the height of that unordered pair is the sum of the two heights, up to a bounded constant. It is also the height identity for the symmetric divisor . Apply this identity to , divide by , and take limits. The errors disappear, givingTogether with evenness and , the recurrence implies for every integer . The associated canonical height pairingis bilinear. Nonnegativity of the height implies its Cauchy-Schwarz inequality, by applying it to integer combinations and then rational approximations. In particular,The height vanishes precisely at torsion points: torsion gives a finite set of multiples, whereas if , every multiple of has bounded naive height and therefore the set of multiples is finite by Northcott theorem.
Now apply the Weak Mordell-Weil theorem with , proved cohomologically in the other essay. Choose a finite set of representatives for , and put . Write an arbitrary point as . ThenIf , this decreases the height by more than . Repeat until the current point has height at most . There are only finitely many such points. Unwinding the equations shows that is generated by this finite bounded-height set together with . This is the height descent lemma, and proves the Mordell-Weil theorem.
Once finite generation is established, the structure theorem for finitely generated abelian groups gives the displayed decomposition. The canonical height pairing is positive definite on the real vector space of the free part: a null direction would, by approximation with integer combinations of generators, give infinitely many lattice points of bounded height, contradicting Northcott theorem. Its determinant is the regulator of an elliptic curve, and its geometry gives practical tools for searching for generators and comparing independence. Thus heights supply both the finiteness mechanism in the proof and the quadratic size function used in arithmetic computations.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 125 3 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
In fact, must all be primes of bad reduction.
At a prime of good reduction of an elliptic curve, the kernel of reduction is the formal group of an elliptic curve evaluated on , using its parameter at the identity. This kernel has no prime-to- torsion: for an integer prime to , the multiplication series is higher-degree integral terms, so for nonzero its first term has strictly smaller valuation than the others and .
For each odd good prime, the entire given torsion subgroup, of order , would therefore inject into . But the Hasse theorem for elliptic curves givesNone can contain a subgroup of order . Hence are bad.
For the prime-two torsion bound for good reduction, use the deeper formal subgroup corresponding to . Part (i), with , shows that is torsion-free and has index in . Therefore any finite torsion subgroup of injects into and has order at most .
If had good reduction at , its rational torsion subgroup of order would consequently have reduction image of order at least . The Hasse theorem for elliptic curves instead gives . This contradiction proves bad reduction at as well, and thereforeThe special formal-group argument at is necessary; prime-to- injectivity alone says nothing about the given -primary torsion there.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 125 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Here a formal group means a one-dimensional commutative formal group law. Over a ring , it is a formal power series satisfyingIn particular, terms of total degree at least . A formal inverse with is obtained recursively. An isomorphism of formal group laws from to is a series with invertible linear coefficient andIts compositional inverse exists over by coefficient recursion.
For , all these series converge on ; the operations preserve that set and make it the group . Use the uniformizer and normalize the valuation by , and write .
We explicitly construct its formal logarithm. DefineThen putThis is a formal series over with linear coefficient . Differentiating associativity in its last variable at givesIt follows that the -derivative of is , the same as that of . Evaluating at therefore provesThe differential is the invariant differential of a formal group law.
Choose an integer . In degree , the coefficient of has valuation at least . Thus the scaled serieshasHere , and the coefficient valuations tend to infinity. Consequently with a convergent integral power series on . Such a series is -Lipschitz. For any , the equation is equivalent to , a strict contraction, to which the contraction mapping theorem applies on the complete ring . It has exactly one solution.
The deep logarithm subgroup of a formal group is obtained as follows. The formal group exponential is the formal compositional inverse of , obtained recursively; equivalently it solves , with . The preceding contraction, applied to the scaled series, constructs its convergent inverse on and agrees with that formal inverse. This supplies the required convergence sketch for as well as a bijectivity proof for the logarithm.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 125 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Let be the -power Frobenius isogenies of . Since is defined over , it commutes with Frobenius:Taking degrees, using multiplicativity and cancelling the nonzero degree of an isogeny , givesBoth differences are separable, so the preceding proof identifies their degrees with rational point counts. Therefore
Isogenous elliptic curves can have different rational point groups. Here is an explicit example. Over , takeThe mapextends across and to a degree- isogeny of elliptic curves with those two points as its kernel. Substitution verifies the target equation, or this follows from the two-isogeny formula with . Both curves are smooth modulo .
For , the numbers of affine points with that abscissa on are , and on they are . Adding the point at infinity gives on each. The first curve has four rational points of order dividing , from and the three roots . The second has only two: its quadratic factor has no root modulo , since is not a square. By the classification of finite abelian groups,They are thus isogenous with equal orders and nonisomorphic groups.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 125 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For an elliptic curve over , where is a prime power, the Hasse theorem for elliptic curves isWe prove it from the degree form on elliptic-curve endomorphisms, including the required degree facts.
A nonzero homomorphism of elliptic curves is a finite surjective morphism; its degree is the degree of the induced extension of function fields. Set the degree of the zero homomorphism to . The degree of an isogeny is also the degree of the pullback of any point divisor: locally, a finite map of smooth curves gives a module of rank equal to the function-field degree, and its fibre length is the sum of the local multiplicities. For a composition, the tower law for function fields givesIf the isogeny of elliptic curves is separable, its pullback of a nonzero invariant differential on an elliptic curve is nonzero. Translation invariance implies that its differential is nonzero at every point, so each fibre point has multiplicity . Every fibre is a translate of the kernel. ThereforeFor an inseparable isogeny, multiplicities must be retained; counting geometric kernel points alone would be incorrect.
Here is a divisor proof of the degree parallelogram law. On , let be the diagonal and the locus . A Weierstrass -function has a double pole at , and the equation describes or . ConsequentlyThis remains valid in characteristic using a general Weierstrass equation of an elliptic curve: the -map still has degree and its two points are exchanged by negation. The divisor identity gives an identity of line bundles. Pull it back by and take degrees. The diagonal is the inverse image of under subtraction and the antidiagonal under addition, soUsing line bundles makes this pullback argument valid even when , or one map is zero, when directly substituting into the rational function would fail.
Let . Applying the degree parallelogram law to and gives , with . Induction givesMore generally, the same recurrence and polarization show that the degree restricted to the subgroup generated by two endomorphisms is a quadratic form: its mixed coefficient is determined by their sum or difference. This can be checked directly by the second-difference recurrence in each integer variable and the parallelogram identity in the two diagonal directions.
Let be the -power Frobenius isogeny of an elliptic curve. It has degree : it is purely inseparable, has one geometric point in each fibre, and sends a local parameter at the rational point to its th power, giving fibre multiplicity . Its pullback of any differential is zero. On the other hand, the standard addition rule for an invariant differential on an elliptic curve givesHence is separable, and its kernel consists exactly of the points fixed by Frobenius, namely . Put and . Thenand the quadratic-form calculation gives, for all ,If , the real polynomial is negative on an open interval. That interval contains a rational with , contradicting the displayed nonnegativity after multiplication by . Thus , which is precisely the Hasse theorem for elliptic curves.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 125 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Write , so , , and . Let denote the class of modulo squares. The required two-torsion square-class homomorphism isThe last value is needed in the domain only if . Every displayed nonexceptional value is nonzero, because an affine point with necessarily has and equals .
Consider a nonvertical line whose three intersection points have -coordinates , counted with multiplicity. Since is monic,If none of these points is , evaluating at givesand therefore the product of their -values is in the square-class group. Tangencies are included by repeated factors. Since negation preserves the -coordinate, this identity says .
If the line passes through , put and write the line as . The other two intersection abscissae satisfyEvaluating at now givesThus , as required. This covers a tangent at a different point whose third intersection is as well.
The tangent at is vertical. For a vertical chord or tangent the two affine intersections are , so their product of square classes is ; in particular agrees with . Finally, adding changes neither side. These cases exhaust the chord-and-tangent group law, proving that the displayed map is a group homomorphism.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 125 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Put . Choose rational projective coordinates in which and its tangent is . Because is an inflection point of a plane cubic, that tangent intersects the cubic in the divisor . Consequently its cubic equation has the formHere , since the restriction to is a nonzero multiple of , and , since smoothness at requires a nonzero -derivative there. Completing the square in , by the rational linear change , gives on Set and . ThenThese are invertible rational projective coordinate changes, and remains the unique point at infinity. Smoothness ensures that the resulting monic cubic has no repeated root. Thus this is a Weierstrass equation of an elliptic curve, without requiring any extraction of a square or cube root in .
On this model write and . To add , take their joining line, or the tangent if , and let be the third intersection counted with multiplicity. DefineFor a vertical line its third intersection is , so . The line through and an affine point is vertical, giving . The tangent at has triple contact, giving . This is the chord-and-tangent group law.
If are rational, their joining line or tangent is rational. Its residual intersection point is rational: substituting the line in the cubic leaves a cubic whose other two roots, counted with multiplicity, are rational. Thus addition preserves . The construction is symmetric in , so it is commutative.
For associativity, use divisor classes. A smooth plane cubic has geometric genus , by the genus-degree formula. The Riemann-Roch theorem says that a divisor of degree on a genus-one curve has a one-dimensional space of sections. Therefore every degree-zero divisor class is uniquely represented by : add , take its unique effective degree-one representative, and then subtract . Uniqueness also follows because a nonconstant function with its only pole a simple pole at would contradict .
Every line section is linearly equivalent to the tangent section . Thus, whenever are collinear, including tangencies,A vertical section gives . Hence the chord-and-tangent group law becomes ordinary addition in the degree-zero Picard group under the injective correspondence . Associativity follows from associativity in that abelian group. Together with closure, identity and inverses already checked, this proves that is an abelian group.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 124 5 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Let , , and let be the cumulative distribution function of . Since the prime omega function is integer-valued, is constant on every half-open interval between consecutive points of the lattice .
Choose and put , . Then , and has the same value throughout . The standard normal distribution function is continuous, so the definition of the Kolmogorov distance giveswhere the second inequality follows by taking a limit from below at . The triangle inequality therefore yieldsThus the integer lattice forces the lower bound:This lattice obstruction to normal approximation does not require a quantitative Erdős-Kac theorem; it follows directly from discreteness and the positive standard normal density near zero.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 124 5 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A useful method of moments in probability states that if real random variables have all moments, for every integer , and is the moment sequence of a moment-determinate probability distribution, then converges to that distribution in the sense of convergence in distribution. In particular, convergence to the standard normal distribution follows from limiting odd moments zero and limiting even moments . The moment-generating function of a standard normal variable, finite in a neighbourhood of zero, ensures moment determinacy.
For the classical Erdős-Kac theorem, put and choose, for example, , with a harmless modification for small . Truncate the prime omega function to primes . The omitted number of distinct prime factors of any is at most , since a product of omitted primes exceeds . Thus this truncation changes the normalized variable by uniformly. Also, the Mertens theorem for reciprocal primes gives
Part (b) transfers every fixed normalized central moment of the truncated prime omega function to the independent Bernoulli random variables model. Indeed, its unnormalized error is at most , using , and this tends to zero for each fixed . In the independent expansion, any singleton index has zero expectation; the leading contributions are pairings, giving exactly the standard normal distribution moments, while blocks of size at least three are negligible after normalization. The method of moments in probability, followed by the uniformly negligible truncation and centering errors, proves the Erdős-Kac theorem.
The same strategy proves the bounded-prime-weight form in part (a). Choose slowly enough that . The omitted weighted contribution is ; its mean is likewise , and its independent variance is by the Mertens theorem for reciprocal primes. Hence the truncated model has the same normalization, and part (b) again transfers each fixed central moment.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 124 5 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For any tuple , expand by choosing an indicator in some positions and the constant in the others. If the selected positions contain distinct primes whose product is , thenFor the corresponding product of the independent Bernoulli random variables , the expectation is exactly . This includes repeated primes, since their indicator functions are idempotent, and the empty selection has zero error. Summing absolute values of all expansion coefficients bounds the difference bywhen . Expanding the th power and summing the absolute coefficient weights gives
It remains to center at the actual expectation. Since , we have . For each , both and have absolute value at most , because all their indicator coefficients have absolute value at most one. The identity therefore bounds the change in the central moment by .
Finally, independence factors each term of the independent central moment. If are the distinct primes of the tuple and their multiplicities, the desired comparison becomesIf , then and both sides vanish, so the formula remains valid. The argument also covers complex coefficients ; a real-valued assumption is needed for the later normal distribution conclusion, not for this centered moment comparison for additive arithmetic functions.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 124 5 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
One general form of the Erdős-Kac theorem is the following. Let be a real strongly additive arithmetic function, with for all primes, and defineIf , then under the discrete uniform distribution on ,Here the arrow denotes convergence in distribution and is the standard normal distribution. Equivalently, the probability of being at most tends to the standard normal distribution function for every real . Replacing by is equivalent, because the difference is bounded by .
This is a general bounded-prime-weight form, not just the special case . In that case the Mertens theorem for reciprocal primes gives and , so the classical prime-factor central limit theorem is
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 124 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Put . The given bound for the Riemann zeta function, together with for , givesThe integral over is bounded, since the Riemann zeta function has no pole on this compact segment. It remains to estimate the fourth moment of the Riemann zeta function through this moving Dirichlet polynomial cutoff.
Let and . In the expansion of , a quadruple occurs precisely forIts oscillatory factor is , and its weight is . When , its integral has length at most . When these products differ, its integral over has absolute value at most . Thus the moving cutoff affects the lower endpoint but preserves the off-diagonal bound from part (a).
Write . The divisor function bounds . Grouping the off-diagonal majorant by the two products and using the weighted row-sum argument in part (a), with coefficient and , bounds it byThis uses only the given divisor-square summatory bound. For bounded , the desired conclusions follow by boundedness on compact segments, so these estimates may be read for large with . We have proved the requested diagonal-plus-error estimate:
The diagonal sum equals . If , then partial summation givesConsequently the full fourth-moment bound is
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 124 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Let , a Dirichlet polynomial supported on primes. The cosine sum is , so its th power is a finite linear combination of , .
The Dirichlet polynomial is supported on integers that are products of exactly primes, counted with multiplicity. Each coefficient is at most by unique prime factorization; for the only coefficient is the one at . As is odd, , so no integer can appear in both supports. Thus every diagonal term vanishes in the mean value of Dirichlet polynomials from part (a).
Both supports lie in . The first error bound in part (a), with that common length, now gives for each termSumming the finitely many terms proves the odd moment of a prime cosine sum estimate:The argument holds for all real and all ; no cancellation estimate involving is needed once the diagonal is absent.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 124 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Expand the two Dirichlet polynomials, keeping the complex conjugate on . The diagonal contributes exactly . If , the exponential integral iswhose absolute value is at most . Thus the mean-value formula isThis also covers .
For , integration of over gives ; the analogous inequality holds with exchanged. Hence . This gives the requested first bound .
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 124 3 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For an additive arithmetic function , one standard form of the Turán-Kubilius inequality usesIt states, with an absolute constant,For real , this also bounds the variance under the discrete uniform distribution, because centering at the actual expectation minimizes the mean square.
For the prime omega function, . The Mertens theorem for reciprocal primes states . The contribution of higher prime powers is bounded by , as proved in 1(a). It follows that and . Writing , the Turán-Kubilius inequality and Chebyshev inequality therefore yieldThe bounded error in is absorbed by, for example, using the threshold around for sufficiently large .
For the multiplication table problem, call a pair good when and . The preceding Chebyshev inequality excludes only pairs by either of the first two conditions. For the greatest common divisor condition, linearity of expectation under uniform sampling of the two coordinates givesMarkov inequality therefore excludes only another pairs.
The prime factors of a product form the union of those of its factors. Consequently, for every good pair,On the other hand, apply the proved concentration estimate at . Since , for large every integer with is exceptional there. There are only such integers. Products of good pairs lie in this exceptional set; products having only bad representations are at most as numerous as the bad pairs. This proves the multiplication-table upper bound, using distinct prime factors alone:
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 124 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Put , where is the Euler--Mascheroni constant, and let . The Buchstab function equation becomesThe given Gamma function bound implies . Indeed,so .
Suppose first that throughout an interval , with . The delay differential equation and integration successively on , , and so on propagate nonnegativity to the entire tail . In particular, is nonnegative and nondecreasing for . Its limit is zero, so it is identically zero there. Thus on that tail.
The delay differential equation then propagates this equality backwards: if for , then for . Repeating finitely many times would give on , contradicting there. Hence every interval contains a point where .
If instead on , the same propagation makes nonpositive and nonincreasing on the tail. Its limit zero again forces it to vanish, giving the same contradiction. Thus every such interval also contains a point where . The oscillation of the Buchstab function is therefore strict on every unit interval:
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 124 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Use the convention that a z-sieved number is a positive integer with no prime factor strictly below ; is included. Such integers are also called rough numbers. Using instead exclusion of primes at most changes an endpoint convention, not the following fixed- asymptotic.
The Buchstab function is the continuous function determined bySuccessive integration over intervals of length one determines the Buchstab function uniquely from its initial values.
A standard fixed- form of Buchstab theorem states that, for each fixed , as ,For , this agrees with the Prime number theorem, since apart from an immaterial endpoint the z-sieved numbers in this range are and the primes from to . The restriction matters: at the count is bounded, so the displayed asymptotic does not hold there.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 124 2 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For the simple symmetric random walk, independence and the Rademacher distribution give the moment-generating functionThe function is even; for its derivative is , since the derivative of is at most one and . Here and are the hyperbolic cosine and hyperbolic tangent. Hence the exponential-moment estimate is
The supplied exponential maximal bound for a symmetric random walk now gives . For , choose ; for , use the elementary bound by one. Thus
Fix , choose , and set . For large these form an increasing sequence. Apply the preceding exponential maximal bound for a symmetric random walk at with threshold . The resulting probability is at mostWe have and . Choose strictly between and ; the displayed probabilities are . By the Borel-Cantelli first lemma, almost surely, eventually . For every , monotonicity of for large therefore givesIntersect the probability-one events for to obtain the upper law of the iterated logarithm:
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





