The Euclidean algorithm gives
Back-substitution supplies the Bezout identity
Thus one solution is . If is any solution, subtraction gives . Since and are coprime, divides . Write ; substitution then gives . Conversely these values satisfy the equation for every integer . Hence all solutions are
Factor the expression as . One of three consecutive integers is divisible by , so . If is odd, its neighbours and are consecutive even integers. One is divisible by and the other by , so their product is divisible by . Since and are coprime integers, their product divides the expression:
The argument also includes negative odd integers and the zero product at .
Define the binomial coefficient as the number of -element subsets of an -element set. Equivalently it is : there are ordered lists of distinct elements, and each subset gives such lists. The empty subset gives .
Distinguish one element of the set. A -element subset either omits it, giving possibilities, or contains it and chooses its other elements from the remaining set, giving possibilities. These cases are disjoint and exhaustive, proving Pascal's identity:
For the requested sum, fix and use mathematical induction on . At , both sides equal one. If the assertion holds at , adding the next summand gives
where the last equality is Pascal's identity. Thus the induction proves the hockey-stick identity for all nonnegative :
Take upward velocity as positive, and consider the closed material system consisting of the rocket and the fuel it ejects during a short interval . Initially its mass and momentum are and . Let be the ejected mass, so the rocket's mass change is . At the end its velocity is , while the ejected gas has inertial velocity to first order; its downward relative velocity need not be downward in the inertial frame.
The final total momentum, to first order, is
Neglect air resistance and take the gravitational acceleration constant. The external gravitational impulse on this material system is to first order. Newton's second law therefore gives , or
The positive thrust is because fuel loss makes . Applying to the rocket alone without accounting for the escaping momentum would give the wrong equation.
For constant and positive mass, divide by and integrate from release at :
Thus the gravity-corrected rocket equation is equivalent to
The potential factors as , so its zeros are and , with a double zero at the origin. Its derivatives are and . Thus there is a local minimum , a local maximum and an inflection at . The potential tends to on the far left and on the far right. These features determine the left-hand sketch.
Put . Newton's second law gives the phase plane system , . Its conserved mechanical energy and trajectories are
The linearization at has eigenvalues , and the surrounding energy curves are closed, so it is a center equilibrium. At the eigenvalues are , giving a saddle equilibrium. The figure shows the cubic potential barrier phase portrait; arrows point right when and left when .
Figure 1.
Cubic potential, trapped oscillations, escaping trajectories and the barrier separatrix
. Details.
For , there are three turning-point roots of . The two leftmost enclose a closed orbit around the origin: the particle oscillates between them. There is also a separate open component to the right of the third root, where an incoming particle turns and escapes to . The closed orbits run clockwise in the plane.
For , the factorization gives the separatrix
The branch with is a homoclinic orbit: it leaves the saddle asymptotically, turns at and returns asymptotically. On , one branch approaches the saddle and the other departs towards infinity. Approaching the saddle takes infinite time. The saddle itself is also an equilibrium trajectory.
For , the particle can cross the barrier. There is one left turning point below ; an incoming particle passes through the well, turns on the left and escapes to the right. For , only a right-hand open component exists, with its turning point beyond . At , the stationary centre coexists with a right-hand open trajectory turning at . Thus negative energy does not imply trapping here: the cubic potential is unbounded below on the right.
For finite sets , the inclusion-exclusion principle states
To prove it, consider an element belonging to exactly of the sets. If , it contributes zero to both sides. If , its contribution on the right is
which is its contribution to the union. Summing these contributions proves the formula.
For the keypad, a first digit zero cannot be entered. Define four families of valid codes: consists of all codes with no zero; consists of codes beginning with ; consists of with ; and consists of with . They cover every valid code. Indeed, if the first digit is not , a zero in the second position is impossible; a zero in the third requires the prefix ; a zero in the fourth requires the middle pair . In the third-position case the last digit cannot also be zero. Hence the only remaining zero-containing possibilities are exactly and .
Their cardinalities are
The only nonempty pairwise intersections are , with codes, and , with one code. All triple and fourfold intersections are empty. Applying inclusion-exclusion therefore gives
The restriction concerns actual preceding keypresses. It cannot license two successive zeros unless the first-key condition is already satisfied.
We use these countability facts: the integers are countable; a finite Cartesian product of countable sets is countable; a countable union of countable sets is countable; and every subset of a countable set is countable. Finite products can be enumerated by listing index tuples in increasing maximum coordinate, and countable unions by diagonal enumeration of pairs of indices.
Fix . For each degree bound , there are finitely many monomials with . An integer polynomial of total degree at most is specified by an integer coefficient for each of them, so these polynomials form a finite Cartesian product of copies of and are countable. Every polynomial has some finite degree bound. Taking the union over proves the countability of integer polynomial rings:
It is infinite because it contains all integer constant polynomials.
For , each nonzero polynomial has only finitely many real roots: repeated application of the factor theorem bounds their number by its degree. The real algebraic numbers are the union of these finite root sets over the countably many nonzero integer polynomials. Thus they are countable. If the real transcendental numbers were countable too, their union with the algebraic numbers would make countable, contrary to the allowed uncountability assumption. Hence there are uncountably many real transcendental numbers.
To construct an algebraically independent real sequence, choose outside the algebraic numbers. Suppose already satisfy the required nonvanishing condition. For each nonzero , write
At least one coefficient polynomial is nonzero, and the inductive hypothesis makes its value at nonzero. Consequently is a nonzero one-variable polynomial and has only finitely many real roots. There are countably many choices of , so the union of all these forbidden roots is countable. Choose outside it, which is possible because is uncountable. This extends the nonvanishing condition to . Recursion therefore gives
In particular the chosen numbers are distinct, since a relation is forbidden. Clearing rational denominators shows that every finite initial segment consists of algebraically independent elements over .
A real sequence converges to if, for every , there is an integer such that for every . A convergent series is one whose partial sums converge to a finite real limit.
If , then . This necessary condition is the term test for divergence. Its converse fails: the harmonic series has terms but diverges. For a direct proof, each block from to contains terms each at least , so contributes at least . Infinitely many such blocks make the partial sums unbounded.
For the positive sequences in the final request, the inequality makes decreasing and bounded below by zero. The bounded monotone sequence theorem gives . Summing the decrements gives
Suppose . Since , this implies
But clipping preserves divergence of a positive series: if infinitely many , the clipped series has infinitely many terms equal to ; otherwise its tail equals the divergent tail of . Either case contradicts the displayed bound. Hence the only possible limit is
This proves the minimum-decrement convergence criterion without assuming that the divergent positive sequence itself tends to zero.
If the prime does not divide , then . The Bezout identity gives integers with . Multiplying by gives . If , both terms on the left are divisible by , so . Thus Euclid lemma holds:
For completeness, existence in the fundamental theorem of arithmetic follows by strong induction on a positive integer . If is prime there is nothing to prove; otherwise with , and the inductive prime factorizations of give one for . The integer has the empty factorization.
For uniqueness, suppose are two prime factorizations. Repeated application of Euclid lemma shows that divides some . Both are primes, so they are equal. Reorder the second list, cancel this equal factor, and repeat. All factors must be matched, including their multiplicities. Thus prime factorization exists and is unique up to the order of its factors. For nonzero negative integers one also records the sign.
The Fermat-Euler theorem states that, for a positive integer and an integer coprime to , , where the Euler totient function counts residue classes coprime to . The case is trivial. For , let be a reduced residue system. Multiplication by permutes it: equality of two resulting residues can be cancelled using the modular inverse of , and the products remain coprime to . Multiplying the residues before and after the permutation gives
Every factor on the right is a unit, so its product can be cancelled. This proves
The integer is prime: none of the primes up to divides it. Therefore . Apply the theorem to and use the supplied congruence:
To connect this to individual digits rather than merely assert periodicity, use long-division remainders and
Induction gives . Since is coprime to , no remainder is zero. The congruence above therefore implies for every , using the unique representative in . In particular
Hence
This is the mechanism of decimal period from multiplicative order: the period divides .
The relevant parameters are and the ring mass , with dimensions length, length, length/time and mass. The wire is fixed and smooth, so there is no additional friction parameter. Because is the only parameter carrying a mass dimension, it cannot enter a dimensionless group governing the period. Using and as the length and time scales, the independent dimensionless variables are and . Dimensional analysis therefore gives
The physical mass cancellation also follows from the energy equation in part (ii), since kinetic and gravitational potential energy are both proportional to .
Along the holonomic constraint , we have and hence speed squared . The smooth wire's normal reaction is perpendicular to the permitted velocity and does no work. Conservation of mechanical energy, with release from rest at height , gives
The turning points are with . One full oscillation has twice the travel time between them:
Set and . After cancelling the scale factors,
so the bead on a parabolic wire has
For , expand the numerator uniformly on :
The integrable endpoint weight gives and , for example by . Therefore the requested small-oscillation period is
The leading frequency is , and the first finite-amplitude correction increases the period. At the ring is stationary; the expression is the limiting period of nonzero small oscillations.
Dot Newton's second law with . The magnetic cross-product term is perpendicular to this velocity, so
Thus
or
The two halves are the kinetic energy and the isotropic spring's potential energy. The expression in the question is twice their sum. The Lorentz force changes the direction of motion but supplies no power, because it is perpendicular to velocity; this explains why the magnetic field does not appear in the conserved mechanical energy. The sign corresponds to charge .
Write . The original PDF contains the cross product ; the TeX aid drops its velocity dot. Since , differentiation and the equation of motion give
The radial restoring force contributes no torque. The vector triple-product identity yields
Meanwhile
The derivatives cancel, proving
This is the magnetic axial angular-momentum invariant. Its first term is the negative of the ordinary angular momentum projected on ; retaining that sign is essential.
Let . Since the field is constant, dotting the equation of motion with eliminates the magnetic term:
This is a harmonic oscillator with frequency . Initially and , because the particle starts at rest. Therefore
The magnetic force modifies the transverse motion but not this projection. The formula also holds trivially when .
For a fixed central gravitational source, the radial and transverse components of Newton's second law in polar coordinates are
The second equation gives , the constant specific angular momentum. Take by choosing the orientation of , and put . Writing and for derivatives with respect to ,
Substituting into the radial equation and dividing by proves the Binet equation
At perihelion the velocity is tangential. The escape velocity is , so and . Consequently . The initial conditions are and . Solving the linear ordinary differential equation gives the parabolic Kepler orbit
Using angular momentum conservation again,
On the outgoing branch is first reached at . Integrate from release at perihelion, using :
More generally the same integral gives , the Barker equation for this parabolic orbit.
For constant particle masses define the centre of mass by , with . Summing Newton's second law over all particles gives
Each pair of internal forces cancels by Newton's third law. Hence
Only the action-reaction condition is needed for this translation law; centrality of the internal forces is needed for the angular momentum result in part (ii).
About a fixed inertial origin, the total angular momentum is . Differentiation gives
because . Separate the external and internal contributions. The combined torque of an internal pair is
The first equality uses Newton's third law, and the second uses the given central-force condition. All internal torques therefore cancel, leaving
An equal-and-opposite pair which is not central need not have zero combined torque; this explains why both internal-force hypotheses matter.
Write and , where . The definition of the centre of mass and its derivative give
Expand the total angular momentum:
The two middle terms vanish. Thus the angular momentum decomposition about the centre of mass is
The first term is orbital angular momentum of the centre; the second is angular momentum about the centre of mass.
Let and . A differentiable central potential energy gives the internal forces
There are no external forces. Differentiating the total kinetic energy and using Newton's second law therefore gives
Since , the last expression is . Thus
This conserves total mechanical energy, including the kinetic energy of centre-of-mass motion, not merely the relative kinetic energy.

Articles by others on the same topic (0)

There are currently no matching articles.