At any division step , an integer divides both exactly when it divides both : one direction uses , and the other uses . Hence
Starting with , , the Euclidean division produces
The nonzero remainders form a strictly decreasing sequence of positive integers. Such a sequence must terminate, since there are only finitely many positive integers below . Suppose is the last nonzero remainder, so . The unchanged greatest common divisor at each step gives
The final equality holds because the positive common divisors of and are precisely the positive divisors of . This proves both termination and correctness of the Euclidean algorithm.
The divisions in the Euclidean algorithm are
The last nonzero remainder is , so
As a check, and ; back-substitution also gives .
At , the first three dual left sides are , and , strictly above their bounds , and . Thus complementary slackness forces . Both dual variables are positive, so both primal inequalities are equalities:
Solving this linear system gives
All components are nonnegative, the two original upper bounds are met exactly, and the objective function equals the dual value. The weak duality bound therefore certifies optimality. The forced zero components and unique solution of the two remaining equalities also prove that the primal optimum is unique.
After removing the two redundant inequalities, the feasible region is
Its lower boundary consists of three line segments or rays: for , then for , then for . The feasible region is everything on or above this boundary in the first quadrant.
Figure 1.
Dual feasible region and optimal supporting line in question 5
. Details.
The boundary extreme points are
Along its three successive pieces, the objective function has respective slopes , and as increases. Thus it decreases to the middle extreme point and increases thereafter. For fixed , moving above the boundary only increases the objective function. Hence
As an algebraic check of the graphical answer, the active inequalities give
with equality at the stated extreme point.
The inequality , together with , implies
Also implies
Thus both inequalities are strictly slack throughout the feasible region. They are redundant: the remaining inequalities imply them, even with strict inequality. By complementary slackness, any primal optimum must therefore have ; this is the principle that strictly slack dual constraints force zero primal variables.
There are two primal inequalities, so there are two nonnegative dual variables. The five primal variables yield five dual inequalities:
Each coefficient column of the primal linear program becomes one row of this dual linear program.
The complementary slackness conditions are
To see their role, decompose the duality gap as
Every summand is nonnegative for feasible solutions, so the gap is zero exactly when every displayed product vanishes. Zero gap implies optimality by weak duality. Conversely, strong duality states that primal and dual optima, when both are attained, have equal values, and hence satisfy these conditions.
For every primal feasible solution , weak duality gives
Thus no primal feasible solution improves on . Similarly, for every dual feasible solution ,
Therefore both candidates are optimal, with the same objective function value. Equality is a linear programming optimality certificate and does not require a separate existence argument.
For feasible solutions , nonnegativity gives
The first inequality uses and ; the second uses and . This is weak duality.
If has rows and columns, attach a nonnegative dual variable to each of the upper-bound constraints. The dual linear program is
Here is the transpose of , and all vector inequalities hold componentwise. Nonnegative dual variables preserve the direction of the original inequalities when taking weighted sums.
If , put
The linearized equation becomes , so
Arbitrarily small initial perturbations can have and grow exponentially. Hence the strict unstable equilibrium condition is
For the particular wire, this occurs precisely at , ; the alternating radii satisfy the stable equilibrium condition.
If , define
The linearized equation is , with bounded simple harmonic motion
Thus the strict stable equilibrium condition is
This is also a sufficient condition for local nonlinear Lyapunov stability. Indeed the equation for the bead on a uniformly rotating wire has the conserved quantity
Its derivative is times the governing equation moved to one side, so it vanishes. At , the last two terms have zero first derivative and positive second derivative . Their strict local minimum traps sufficiently small perturbations. The motion is bounded rather than asymptotically returning to rest.
Suppose a line through meets each . Its intersection with is different from , so lies in . A nonzero direction vector for must therefore satisfy
A square matrix admitting a nonzero vector with has zero determinant. Expanding gives
Thus the necessary condition is
The condition is not sufficient. Take , which is on none of the three original lines. It satisfies the condition, since . The three plane equations become
Their common intersection is the single line . Any proposed line through meeting all three original lines would have to be this . But never meets : their second and third coordinates differ. The zero determinant guarantees a common direction for the three planes; it does not guarantee the required intersections. This is a parallel obstruction to a transversal of three skew lines.
The three lines have the convenient parametric equations
For , substitute , in the plane through a point and a line given by a cross product formula. Its normal vector is . Cyclically permuting the coordinates gives all three planes:
Each normal vector is nonzero because is not on the corresponding line. Thus these are genuine planes, and each is unique.
Apply the central limit theorem to the independent and identically distributed random variables , whose mean and variance are and . It gives the approximate standard normal distribution
The supplied standard normal quantile leaves probability in each tail. Hence
Since , this event is equivalent to
For , equivalently integer , both denominators below are positive. Inverting the inequalities gives the approximate confidence interval
The approximation is justified for large ; positivity at by itself does not guarantee accurate coverage. This construction is a confidence interval from a relative normal pivot: the unknown scale remains inside the pivotal ratio until the inequalities are inverted. Its meaning is that the random interval covers the fixed statistical parameter with probability approximately under repeated sampling.
The recurrence relation at gives . Consequently
By variance additivity for independent random variables, the variance of their sample mean is
Be careful about the index: the probability density function already contains a factor , so . The recurrence relation at yields . Therefore linearity of expectation gives
Thus is an unbiased estimator.
For , the change of variables gives
For , use and integration by parts:
The boundary term vanishes: at zero, and the exponential decay dominates the power at infinity. These estimates also establish convergence of the improper integrals used above.
For an observed random sample with all , which happens almost surely, independence gives the likelihood function
Ignoring a term independent of , the log-likelihood and its derivative are
This derivative is positive for and negative for . Thus there is a unique global maximum, and the maximum-likelihood estimator is
Assuming is measurable, applying it separately to independent and identically distributed random variables preserves those properties. Thus have common mean and variance . For , the central limit theorem gives
Hence, for large , the approximate probability distribution is
The second argument is the variance. If , this sample mean equals almost surely, so the appropriate description is a point mass at .

There are unlisted articles, also show them or only show them.