Arithmetic progression Created 2026-09-24 Updated 2026-10-18
An arithmetic progression is a sequence with a constant common difference between consecutive sequence terms. It has the form and is nonconstant when . Using for the common difference and numbering the first sequence term as , its explicit and recursive descriptions areThe explicit formula reaches any position directly; the recurrence reaches the next position from the current one. The factor counts the steps after the first entry. For real , a positive common difference makes the sequence increase, a negative one makes it decrease, and zero makes it constant.[ref]
11.2 Arithmetic Sequences. Precalculus 2e, §11.2 Arithmetic Sequences: definition, Recursive Formula for an Arithmetic Sequence and Explicit Formula for an Arithmetic Sequence
For an original example, start at seven and add three each time:The eighth entry is : eight sequence terms require seven increments. This counting principle makes arithmetic progressions useful for regularly spaced positions, repeated equal additions, and iteration over evenly spaced integers. The values need not be integers; starting at with common difference gives .
A geometric progression instead holds a ratio constant. In the displayed arithmetic progression, and differ even though . Multiplying each entry by two would give a different kind of repeated update from adding three. Distinguishing the two rules matters before predicting later entries or adding the sequence terms.
Equal differences also appear in Nicomachus's treatment of arithmetic proportion. He describes successions of at least three numbers whose neighboring differences agree, then explains how regularly omitting counting numbers changes the common gap. This connects the progression to the arithmetic mean: a middle entry is equally far from its two neighbors.[ref]
Asymptotic comparison of exponential functions Created 2026-09-24 Updated 2026-10-14
For positive bases , comparison of the exponential functions and reduces to a geometric progression:If , this ratio tends to zero, so in little o notation. If , the ratio is one; if , it grows without bound.
Consequently, provided at least one coefficient is nonzero, a finite sum with distinct positive bases is asymptotically equivalent to its largest-base term whose coefficient is nonzero. For example,The relative difference against first drops below one percent at the integer . Dividing by the proposed dominant term provides an explicit error estimate, not just a comparison of two rapidly growing numbers. If several terms have the same largest base, their coefficients must first be combined; cancellation can remove that base entirely.
Common ratio 2026-10-14
The common ratio of a geometric progression is the multiplier in . Whenever , it can be recovered as . For and , the first step gives zero and all subsequent terms remain zero, so those later quotients are undefined even though the recurrence remains valid. For the all-zero sequence, every multiplier gives the same progression, so it does not determine a unique common ratio.
Finite geometric series Created 2026-09-24 Updated 2026-10-14
A finite geometric series is a sum of consecutive terms of a geometric progression. With first term and terms, including for the empty sum,Unlike an infinite geometric series, this identity does not need . For example, . The number of terms is five; the largest exponent is four.
The cancellation behind the formula is especially useful to remember: multiplying by the common ratio shifts all terms one place. In , every interior term cancels, leaving . Division by gives the identity when ; at the sum is directly . The same argument works for complex numbers.
For integers and , the shifted version isThere are terms. All powers must be defined; if a negative exponent is present, must be nonzero. At this sum is simply . The finite trigonometric sum uses this identity with a complex exponential as the common ratio.
Finite sums of positive integers in a geometric progression already appear in Euclid's Elements, Book IX, Proposition 35. The argument there compares differences of proportional numbers; Joyce's guide rewrites its conclusion as the modern finite-sum formula. This historical result concerns finite sums, without asserting an infinite limit. [ref]
https://mathcs.clarku.edu/~djoyce/elements/bookIX/propIX35.html. Euclid, Elements IX.35, with David Joyce's guide to the algebraic form
Geometric partition bounds for a power-law improper integral Created 2026-10-18 Updated 2026-10-25
On the geometric progression , with , the interval widths are . The left-endpoint Riemann sum for the decreasing integrand is the geometric seriesThe right-endpoint sum is . Integral comparison on each interval gives . Both bounds tend to as , proving the improper integral by the squeeze theorem. Although the largest interval width is unbounded on the infinite domain, these explicit upper and lower bounds justify the limit without incorrectly applying a finite-interval mesh argument to the entire half-line.
Geometric series Created 2026-09-24 Updated 2026-10-20
A geometric series adds the terms of a geometric progression:Its ordinary infinite sum is the limit of a sequence of partial sums , rather than a new operation that adds infinitely many terms at once. For that are real numbers or complex numbers, if , the series is absolutely convergent andWhen , this condition on the modulus of is also necessary: for the terms fail to tend to zero. The all-zero series converges for every . The finite geometric series identity and give the result with almost no extra algebra. [ref]
Decaying terms, accumulating sums, and the failure of an undamped alternating series
. Details. With and , the partial sums approach from below. Changing the common ratio to makes the partial sums approach from alternating sides: their increments still shrink. At , those increments never shrink, and the partial sums remain . Substituting into does not supply the ordinary sum of that divergent series.
The formula is useful because many apparently different problems share a fixed multiplier. A repeating decimal such as isA geometric distribution counting failures before the first success normalizes by the same identity: for , the probabilities on add to one. The comparison test for series uses a bound by a decaying geometric progression to establish absolute convergence without an exact formula for the series being studied. The iterated contraction gives a summable orbit result uses precisely this idea for repeated applications of a map.
The remainder of a geometric series gives more than an eventual limit: it states exactly how much an approximation omits. A common ratio close to one still gives a convergent series, but can require many terms for a useful approximation.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 6 1 iii Solution Created 2026-10-03 Updated 2026-10-14
Use and normalized measure . The Fourier partial sum at zero is the real linear functionalwhere the Dirichlet kernel isThe quotient follows by summing the finite geometric progression, with its removable value . It is a real continuous periodic function. Ifthen . This bound is its exact operator norm even on the real continuous functions. Indeed, for setIt is real, continuous and periodic with norm at most one, andby dominated convergence. At zeros of the kernel the integrand is zero, and elsewhere its limit is .
For , . Using evenness and putting givesFor the last inequality, split into the first complete intervals : their sine integrals are two and . The harmonic sum tends to infinity. This proves the Dirichlet kernel harmonic lower bound.
Choose with , then choose sufficiently small that . ThusThis constructs continuous near-maximizers, rather than using the discontinuous sign of the kernel as the desired function.
Past exam of the mathematics course of the University of Cambridge 2006 ia Paper 2 9F Solution Created 2026-09-24 Updated 2026-10-14
Condition on the current generation size. By independence of offspring families, . Taking the expected value gives the probability generating function recursionInduction therefore proves the branching-process generating-function iterationwhere the right side means -fold composition, not an ordinary power.
Let and be the offspring mean and variance, assuming a finite second moment. Differentiating the generating-function recursion at one gives and, with ,Since , this impliesIteration and summation of the geometric progression give the mean and variance of a Galton-Watson generation:For the offspring count is identically zero, so every later generation has zero variance. The zeroth generation always has zero variance. Finiteness of the needed moments is an assumption for this finite-valued variance formula, not a consequence of merely having a probability generating function. With finite positive mean but infinite offspring variance, all positive-generation variances are infinite.
For the total count, make the generation convention explicit. If the first generations include the ancestor, put and , with . Given children of the ancestor, each starts an independent depth- descendant tree with generating function . The ancestor contributes an additional factor , soThis is the finite-horizon total progeny generating function. If instead “first generations” means descendants , excluding , write for that convention. Conditioning on the children now gives , with and . The two conventions encode the same tree but different counts.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 47 1 Solution Created 2026-10-03 Updated 2026-10-14
Interpret the forecasts as best linear prediction from a finite past. For a causal autoregressive process, the innovations are orthogonal to previous observations. If they also have zero conditional mean given the past, the same forecasts are conditional means; white noise by itself guarantees only the linear-prediction interpretation.
Let be the process mean and write its centered autoregression as . Set for , and recursively putThe forecast is a linear combination of the observed last values. Subtracting the recursion from the future autoregression shows that the prediction error is a linear combination of future innovations, hence orthogonal to every observed value. This proves the optimal projection property, rather than merely suggesting that future noise should be replaced by zero. In particular,The empty sum for is zero. Taking gives the centered convention. This is the recursive forecasts of an autoregressive process construction.
For the stable order-one equation, use its stationary causal solutionThe series converges in mean square because and the white noise innovations have a common finite variance . Orthogonality of their distinct time indices givesAdding the deterministic mean therefore yields weak stationarity for , withThe autocorrelation function assumes ; a zero-variance process has no normalized correlation. A recursion from an arbitrary nonstationary initial value would have transient moments, so the stationary-solution interpretation is important here.
Iteration gives . The innovation sum is orthogonal to the observed past, givingFor the integrated process, the backshift operator subtracts consecutive levels, so . Consequently . If the last increment is observed, substitute its forecast and sum the geometric progression:This is the forecasts of an integrated AR(1) process formula. Its final term is bounded as , even for negative , hence the forecast's long-run slope is the drift:With an initial level orthogonal to future innovations, the level formula is also the best linear forecast from the observed levels. Without that initial-level condition, it is the increment-based recursive forecast, and the levels could contain additional predictive information. The level formula uses , or a known when . With just and no model for the initial level, the last increment cannot be recovered from the supplied observations; a one-observation level forecast would need that additional information.
Past exam of the mathematics course of the University of Cambridge 2013 ib Paper 2 19C Solution Created 2026-09-24 Updated 2026-10-07
Convergence of a numerical method on means that its grid error obeys as , with consistent initial values.
First, the implicit step of Backward Euler method is well-defined for : the map is a contraction mapping on , so the Banach fixed-point theorem gives a unique solution. Let , finite under the stated smoothness. The exact solution's step defect isso . Subtract the exact and numerical step equations. The Lipschitz condition givesWith exact initial data, sum this geometric progression to obtainFor and , , so the bracket is at most . Thus the global error is , uniformly on , and Backward Euler method converges with order one. A vanishing initial error adds only .
Order one is sharp: for , and , .
For the Dahlquist test equation , the stability function is , . Therefore its linear stability domain isThe strict inequality gives decay; equality gives bounded amplification. The whole closed left half-plane lies in this region, so Backward Euler method is A-stable.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 11 2 Solution Created 2026-10-03 Updated 2026-10-07
Write . A sequence in the circle group is an equidistributed sequence if, for every interval ,where is its normalized length. Equivalently, averages of every continuous function along the sequence tend to its circle integral. Trigonometric polynomials approximate continuous functions, and interval indicators can be squeezed between continuous functions with arbitrarily close integrals. The nonconstant additive characters have integral zero. These facts give the Weyl criterion:This is the link between equidistribution and cancellation in exponential sums.
Suppose every positive-shift difference sequence were equidistributed. Fix and set . For every fixed , the Weyl criterion would giveThe omitted final terms change a normalized average by at most .
Here is the needed Van der Corput inequality for finite scalar sequences. Extend by zero outside and average consecutive translates of the sum. Cauchy-Schwarz givesIndeed, apply Cauchy-Schwarz to and expand the squared inner sum. Taking first leaves a bound ; then let . Every nonzero Fourier average of vanishes, so the Weyl criterion makes equidistributed. This is the differencing obstruction to equidistribution. By contraposition, a non-equidistributed sequence has a non-equidistributed difference for some positive , hence for some as requested.
For , the difference is . For any nonzero integer , its exponential sum is a constant phase times a geometric progression with ratio . Its normalized magnitude is at most , which tends to zero. Thus every positive-shift difference is equidistributed, and the contraposition just established proves
Index the stated geometric progression by , . Then , and its left-endpoint contribution isHence the approximation is a geometric series withSince and , the ratio satisfies and the series converges. The integrand is decreasing, so the left-endpoint sum is an upper bound for the improper integral.
Progressive number 2026-10-20
A positive integer for which some division with integers and has as consecutive terms of a geometric progression in some order. Writing a reduced common ratio as with and , the three terms have the form for a positive integer .
Repeated-bath dialysis model 2026-10-14
Consider an original ideal model with sample volume , bath volume , and initial sample solute concentration . Assume each volume is fixed, a freely permeant, nonbinding solute, no chemical reactions, complete mixing on each side, and equal concentrations at equilibrium. Each fresh bath initially contains none of this solute. The protein is perfectly retained in this model.
The first equilibration redistributes the initial amount of substance through both compartments. Conservation givesThis denominator includes the sample itself. For the chosen and , , rather than . Nine-tenths of the initial solute is in the bath and one-tenth remains in the sample; nothing has vanished during equilibration.
Discarding the equilibrated bath removes its solute. A second fresh bath starts with only of solute in the entire system, so the same argument applies again. Induction gives the geometric progressionHere counts completed equilibrations with fresh baths: is the first bath, follows one replacement, and follows two replacements. The normalized sample concentrations are respectively , and . Leaving the first bath in place for longer cannot lower the ideal equilibrium value below .
Repeated fresh baths reduce normalized solute concentration geometrically
. Original fixed-volume model, not experimental data. The left panel normalizes the first bath's conserved amount of substance by , distinguishing the sample's share from the bath's share. The right panel plots sample solute concentration divided by after each completed fresh-bath equilibration on a logarithmic vertical axis. The protein curve is normalized independently by its own initial concentration. The perfectly retained protein stays at normalized concentration one only because its amount of substance and the sample volume are fixed. Details.The same conservation argument handles a fresh bath already containing a permeant solute at fixed concentration :Thus the sample approaches , not necessarily zero. For example, if a hypothetical new buffer component starts at zero in the sample and at in every bath, its sample concentration reaches , and in the three equilibrations. Outward removal and inward replacement follow the same mathematics.
Equilibrium fractions do not specify elapsed time. An illustrative well-mixed linear ordinary differential equation model within one bath isHere is an effective transfer coefficient with units of volume per time. Adding the two equations conserves ; subtracting their normalized forms givesThe difference undergoes exponential decay. A bath replacement resets , renewing the driving difference without making jump instantly. The plotted points are equilibrium endpoints, not a measured time course or a timetable for an arbitrary protein.
Real sample volume can change through osmosis; proteins can be lost through leakage or adsorption to the semipermeable membrane. Consequently, a measured decrease in protein concentration alone cannot distinguish dilution from loss of protein. Measuring recovered volume as well as protein concentration permits an estimate of recovered protein mass.[ref]
Dialysis: an overview, Pierce Biotechnology technical note. Tech Tip 20, p. 2, Other Factors in Dialysis: water transport, volume change and nonspecific membrane binding
Thomas Robert Malthus Created 2026-10-25 Updated 2026-11-05
Thomas Robert Malthus made the comparison between population growth and the growth of food supply explicit in his 1798 An Essay on the Principle of Population by Thomas Robert Malthus. In Chapters I–II, he assumed that unchecked numbers could follow a geometric progression, taking doubling every 25 years as his rule, while food supply gained a fixed amount in each such period, an arithmetic progression. These were different hypotheses about two quantities, rather than a calculation from a single universal growth law.[ref]
An Essay on the Principle of Population by Thomas Robert Malthus. Chapters I–II, first edition of 1798, geometric population increase and arithmetic subsistence increase
With equal initial scales, his comparison can be written as and after periods of 25 years. Then grows without bound. The corresponding continuous exponential growth rate for numbers would be per year. The mathematics describes the consequence of the assumed rates; it does not establish that actual birth, death, human migration and food-production rates stay fixed. Demography can test population assumptions against counts, age composition and measured rates.


