The Euclidean algorithm gives
Thus the greatest common divisor is . The extended Euclidean algorithm reverses these divisions:
This supplies the Bezout identity with , .
To obtain all solutions of a linear Diophantine equation, subtract this particular solution from any other and divide by . The result is . Since and are coprime integers, divides , giving
Every displayed pair satisfies the original linear Diophantine equation, so the parametrization is exhaustive.
For the modular arithmetic calculation, , so is the modular inverse of . Multiplication gives . The admissible integers are for , ending at ; the next is . There are such integers.
For integers , define the binomial coefficient by
Here the factorial is the product of the positive integers up to . This also counts the -element subsets of an -element set: an ordered choice has possibilities, and each subset is ordered in ways.
Directly from the factorial definition, when ,
This is Pascal's identity.
The required hockey-stick identity follows by mathematical induction on , with fixed. For , both sides are . If it holds at , adding the next binomial coefficient and using Pascal's identity gives
Therefore for every ,
In classical charged particle in a uniform magnetic field motion, the Lorentz force and Newton's second law give
Assume and choose an orthonormal coordinate system with , . Write , retaining the sign of the electric charge. The velocity equations are
Thus the parallel velocity is constant, and the perpendicular velocity rotates at constant angular frequency. Choosing the time origin and perpendicular axes conveniently gives
Integrating the velocity, one obtains
The first two coordinates describe a circle of radius , while the third advances uniformly. This is helical motion in a uniform magnetic field: the helix has axis parallel to through the guiding centre. Its cyclotron frequency is
and its signed angular velocity vector about that axis is . The minus sign follows from the ordering in the Lorentz force. The helix degenerates to a circle when and to a straight line when . If or , there is only straight-line motion. In a relativistic extension with fixed Lorentz factor , the frequency becomes ; the classical result above uses as momentum.
A four-vector is a collection of four components that transforms by the same Lorentz transformation as . Use the metric signature . The Lorentzian inner product is
A nonzero four-vector is a timelike vector, null vector or spacelike vector according as is negative, zero or positive. Reversing the metric signature reverses the signs used to name these three classes, without changing their geometric meaning.
For a frame moving at speed along the positive axis, write and use the Lorentz factor . The component Lorentz transformation is
Expanding the first two squares gives
The other two components are unchanged, so . Consequently a timelike vector remains timelike under a Lorentz transformation.
For a nonzero null vector, and . Set and . Then and . If the zero four-vector is included among null vectors, take and any unit vector.
For two future-pointing null vectors, write and with . The sum of future-pointing null vectors satisfies
because the ordinary inner product of two unit vectors is at most one. The sum is null if their spatial directions coincide, and timelike otherwise. Its positive time component makes the sum nonzero and future-pointing.
A real sequence has limit of a sequence when
A series is a convergent series with sum when its partial sums have limit of a sequence .
For the first comparison test for series, either of the two allowed bounds implies . Hence
The partial sums form a monotone bounded sequence, so they converge. The series is convergent.
For the exponent , use for . The resulting telescoping series bounds every partial sum by , proving that the series converges by the monotone bounded sequence property. To prove divergence of the harmonic series, group the terms with : their sum is at least . Thus its partial sums are unbounded. If , then , so the comparison test for series proves
For the weighted square assumption, the finite-dimensional Cauchy-Schwarz inequality gives, for every ,
Again the positive partial sums form a monotone bounded sequence. This is the weighted square roots of a summable sequence argument, with . The weighted square condition implies .
The converse is false. Take . Each block contributes at most , and the resulting geometric series converges. But , whose harmonic series diverges. This proves the counterexample without assuming the full P-series criterion.
The Fermat-Euler theorem states that, for an integer and any integer coprime to ,
where the Euler totient function counts the residue classes coprime to .
Let be representatives of these residue classes. Multiplication by gives a permutation of them: each remains coprime to , and implies by cancellation using the modular inverse of . Multiplying all the resulting modular congruences yields
The product is itself coprime to , so it has a modular inverse and can be canceled. This proves the Fermat-Euler theorem. For , the congruence is trivial; no separate argument is needed.
For the odd prime , the Fermat-Euler theorem gives . Therefore the residue class obeys . Since a prime number dividing a product divides one of its factors,
If is a quadratic residue, choose with . Then is nonzero modulo , and Fermat's little theorem gives
This proves the quadratic residue direction of Euler's criterion.
Suppose is a quadratic nonresidue. On the nonzero residue classes modulo , define the involution
It is an involution because . A fixed point would satisfy , which is excluded by the quadratic nonresidue hypothesis. Thus it partitions the classes into disjoint pairs , each with product . Consequently
Now evaluate the same product by pairing every class with its own modular inverse. The only classes equal to their modular inverses solve and hence are and . All other pairs have product one. The complete product is therefore , so
Together with the preceding part, this is Euler's criterion; the pairing argument establishes the converse without assuming it.
Fermat's little theorem reduces the exponent modulo because is a prime number and is coprime to it. Compute , then and . Thus for an integer , and
The exponent is , rather than an iterated left-associated power.
Let be the set of infinite binary sequences. Suppose it were countable and list all its members as , writing for the th entry of row . A finite listing could be repeated to make such a list as well. Define the binary sequence by . It differs from the th row in coordinate , for every . Thus it belongs to but is missing from the list, a contradiction. The set is uncountable, by Cantor's diagonal argument.
Use . If a bijection maps onto the even natural numbers, its restriction is a bijection from onto an infinite set. Moreover, its restriction to the complement of maps onto the odd natural numbers. Both sets are therefore infinite.
Conversely, suppose that and its complement are infinite. Applying the increasing enumeration of an infinite subset of natural numbers to each gives
For completeness, successively choose the least unused member. The process never stops because the set is infinite, and it lists every member: an omitted member would have infinitely many selected natural numbers below it, which is impossible. Define
This is injective on each list, their images are disjoint, and together their images cover . Thus it is a bijection and maps onto . Both infinitude conditions are necessary and sufficient. If a convention includes zero in , index each list from zero and use , instead.
Use uncountability by interleaving prescribed binary coordinates. For each arbitrary binary sequence , define another binary sequence by
There are infinitely many zero coordinates, namely , so . There are also infinitely many coordinates agreeing with the prescribed binary expansion, namely , so . The coordinates recover , making this map an injection of the uncountable set of all binary sequences into . If were a countable set, composing with an injection into would make all binary sequences countable, contrary to part (i). Therefore The construction works for every prescribed binary sequence ; no special distribution property of the digits of is needed.
For finite sets , the inclusion-exclusion principle states
To prove it, count the contribution of one element. If it belongs to exactly of the sets, it is counted by intersections of size . Its total weight is
using the binomial theorem. An element belonging to none contributes zero. Summing these weights gives the cardinality of the union and proves the inclusion-exclusion principle. Equivalently, within a finite ambient set , the number avoiding every is the sum over all , with sign and the empty intersection interpreted as .
In the ambient set of all functions from to itself, let be the forbidden event . Apply the avoidance form of the inclusion-exclusion principle from part (i).
For a proper subset of the cyclic difference constraints, with , the selected edges form disjoint paths around the cycle, including isolated vertices. There are components. On each component, choosing one value of arbitrarily determines all the other values by the prescribed differences. No consistency condition occurs because the cycle has been broken. Therefore
This also works for , whose two directed constraints use the same pair of vertices: any single constraint leaves one freely chosen value.
If all constraints hold, summing them around the cycle gives the necessary condition
It holds when is odd and fails when is even, the latter sum being congruent to . When it holds, choose in ways and determine every other value; the final constraint is then consistent. Thus the full intersection has size for odd and for even .
There are subsets of size . By the binomial theorem,
Hence the number of admissible functions is
First apply momentum conservation to the rocket and the infinitesimal amount of expelled gas. During , the exhaust mass is and its inertial velocity, to first order, is . With no dust, the momentum balance is
It gives the rocket equation , while .
For a dust-collecting rocket, the incoming dust mass is with zero initial momentum. The same balance has rocket mass after the interval, so
Consequently
The second term in the acceleration equation accounts for the momentum required to bring collected dust up to rocket speed.
Set and , so . As long as the engines operate and , the velocity increases and time can be eliminated:
Integrating from , , gives
Thus the required mass–velocity relation is
If , this formula would give as . In this interval, . A real rocket retains positive body mass even after its fuel is gone, and collected dust only increases that residual mass. It therefore cannot follow this branch all the way to zero mass: its fuel must run out while . Indeed the hypothetical time integral is integrable at when , so even the formal zero-mass endpoint would occur at finite time.
If , the same relation instead gives as . The mass first decreases, reaches its minimum at , and then increases because dust arrives faster than fuel is expelled. The time integral now diverges at : under indefinitely maintained thrust, approaches asymptotically while stored dust grows without bound. At that limiting speed, thrust balances the dust-loading term , and . This is the physical reason the total rocket mass no longer signals fuel exhaustion. A rocket with a finite initial fuel supply still runs out at finite time and before reaching ; increasing total mass does not create new fuel.
For any vector , differentiating its components and the rotating basis gives the rotating-frame derivative formula
Apply it twice to the position , with constant angular velocity . The inertial acceleration is
where dots denote rotating-frame derivatives. Newton's second law therefore becomes
The last terms are the Coriolis force and the force corresponding to centrifugal acceleration.
For the particle on a uniformly rotating inclined plane, choose orthonormal vectors along the horizontal axis and up the slope, and set , the upward normal vector. Then and
Here is the normal reaction. The marble is modeled as the smooth sliding particle specified by the printed equations, without an additional rolling constraint. The rotating-frame Coriolis acceleration and centrifugal acceleration are respectively
The normal rotating-frame acceleration is zero, so the normal reaction is not generally ; it satisfies
Projecting the same equation onto the two tangential axes gives exactly
Multiply the equations by and and add. The Coriolis force terms cancel, as expected because this force does no work relative to the rotating frame. The normal reaction also does no work along the plane. The conserved quantity is rotating-frame kinetic energy plus gravitational and centrifugal potential energy:
This need not be the conserved inertial energy, since the externally driven rotating plane can exchange energy with the particle.
The area element in plane polar coordinates is . Thus the axial moment of inertia is
For the removed material, the angular width is , and
Its moment of inertia is therefore , leaving
The torque equation gives constant angular acceleration, so the time to reach the prescribed angular speed from rest is
To find the centre of mass after removing material, let point along the bisector of the missing sector in the disc. The original disc has zero first mass moment about its centre. The missing sector has zero transverse first moment by reflection symmetry, while its component along is
because the radial integral is . The remaining first moment is . Dividing by the given mass gives the body-fixed centre of mass
It lies away from the missing sector. In the inertial frame, let be the moment the applied torque stops and let give the orientation of that sector's bisector. Then, with ,
The centre of mass has inward centripetal acceleration of magnitude . The required real force is the constraint reaction exerted by the fixed rod and its support. Its horizontal resultant is ; a zero applied axial torque does not imply a zero resultant force.
For a massive particle of rest mass , its four-momentum is , where the four-velocity is , and . With metric signature , . A photon has four-momentum , a future-pointing null vector. Four-momentum conservation states that the total incoming and outgoing four-momenta agree for an isolated interaction; this includes both energy and momentum conservation in every inertial frame.
Take the incoming photon direction as . Its energy is , so the total initial four-momentum is
The invariant mass available after photon absorption is therefore . In the centre-of-momentum frame, the two equal daughters have opposite momenta. Their total energy is at least their combined rest energy , with equality precisely when both daughters have zero momentum in that frame. Thus the mass threshold after photon absorption is
The bound is attainable kinematically by taking each daughter four-momentum equal to ; each then has the required rest mass. It immediately gives as .
At this threshold both daughters move with the centre-of-momentum frame. The common laboratory velocity follows from :
For , its continuous limiting value is zero. At smaller allowed daughter rest masses, some of the centre-of-momentum energy appears as their relative kinetic energy, so their four-momenta need not be .

Articles by others on the same topic (0)

There are currently no matching articles.