The Wilson theorem states that for a prime ,Indeed, every nonzero residue modulo has a unique multiplicative inverse. The only residues equal to their own inverses solve , hence are and . Pairing every other residue with its distinct inverse leaves
A relation on is a subset of . An equivalence relation is reflexive, symmetric, and transitive. Its equivalence class at is .
The relation is reflexive and symmetric, but not transitive. For example,while . Hence it is not an equivalence relation.
This is an equivalence relation: ; if , then ; and integer differences add. Its classes arethe cosets of in .
This relation is reflexive and transitive, but not symmetric: whereas . It is therefore not an equivalence relation.
The parallel axis theorem says that for an axis through , parallel to the centre-of-mass axis in direction ,LetMoments about the axis through add, soUsing and solving giveswhen the denominator is nonzero. In the degenerate equal-distance case, this inertia equation alone does not determine ; the centre-of-mass equation supplies the remaining information.
Set . If is in the future lightcone of and in that of , thenAdding and using the triangle inequality givesThus the statement is true.
False. Takewith coordinates written as . Both and lie on the future lightcone of , but and are simultaneous and spatially separated, so neither is in the future lightcone of the other.
True. The assumptions giveAdding and applying the triangle inequality provesso is in the future lightcone of .
Again set and writeA boost of velocity givesDefineThe hypothesis says . Put and . Causality gives , while , and , . ThereforeButHence at least one of is positive. By continuity, for some physical velocity sufficiently close to that endpoint. In the corresponding inertial frame,as required.
The Euler theorem states that if , thenLet be the reduced residue classes modulo . Multiplication by permutes them, soTheir product is a unit and may be cancelled, proving the theorem.
A decimal integer is congruent modulo to its digit sum. Cyclic permutation does not change that sum. Hence every rotation of a multiple of is again divisible by .
Divisibility by or depends only on the final digit. As the digits are cyclically rotated, every digit appears in the final position. Thus every rotation is divisible by exactly when every digit is divisible by .
As printed, the claim is false: is 7-cyclic-divisible because its rotations are and , but its digits are not all equal to and its length is not a multiple of .
The standard rotation argument proves the likely intended statement. If an -digit integer and all its rotations are divisible by , then for each leading digit ,is divisible by . The multiplicative order of modulo is . If , then , forcing every digit to be divisible by , hence to be either or . Thus the valid conclusion is:The counterexample shows why “all its digits are equal to 7” cannot replace the first alternative.
LetBy Fermat's little theorem, . If the digit count is a multiple of , then . The cyclic decimal divisibility relation givesand hence also modulo . Since is coprime to , every is a unit modulo . Thereforefor every . Since , this proves the required equivalence.
For ,If , then the recurrence givesInduction yields the Fibonacci determinant identity known as Cassini's identity:
For fixed , setAt , . Applying the Fibonacci recurrence to every term and cancelling gives . Induction therefore proves
For a nonempty set bounded above, is its least upper bound: every satisfies , and every fails to be an upper bound.
Every convergent sequence is bounded. Conversely, let be increasing and bounded above, and set . For any , is not an upper bound, so some . Monotonicity then givesfor all . Hence , proving the monotone bounded sequence criterion.
LetFor , the binomial theorem givesConsequently : given , the displayed rational upper bound is below for all sufficiently large . Thus, directly from the definition of convergence,
A set is countable set if it is finite or admits an enumeration by natural numbers. If are countable, choose enumerations . Since is countable by diagonal enumeration, the array enumerates after repetitions are removed. This proves that a countable union of countable sets is countable.
The integers are countable, so is countable. Mapping to surjects onto , hence is countable. The same diagonal argument shows that is countable whenever are.
Finally, if the reals in had decimal expansions , choose a decimal whose th digit differs from the th digit of , avoiding digits and to remove expansion ambiguity. This number differs from every listed number. The Cantor diagonal argument proves that is uncountable.
No. For every , the line contains the origin. These lines are distinct, so the uncountable familyhas nonempty common intersection.
Yes. The set is countable, hence the set of unordered pairs of distinct rational points is countable. Two distinct points determine at most one line. Mapping each such pair to its line therefore has countable image, and every line in the stated collection lies in that image. Thus the collection is countable.
The particle moves on a horizontal circle of radiusIf is the tension in the light rod, vertical and radial balance giveDividing eliminates both and , yielding the rotating conical pendulum with an offset pivot conditionThe ratio under the square root has units . The answer is independent of ; increasing increases the orbit radius and lowers the angular velocity required at fixed .
The spring length is , its tension is , and the orbit radius isVertical balance first givesRadial balance isUsing the vertical equation,Unlike the rigid-rod result, this depends on : a larger mass stretches the spring farther and changes the radius of the orbit.
A central force conserves angular momentumPut . Since ,where primes now denote differentiation with respect to . Substitution into the radial equation gives the Binet equation
For , one has , soAfter choosing the angular origin, the solution isFor , using and givesThis is an ellipse, with the force centre at one focus, as described by a Kepler orbit.
ForBinet's equation becomesA circular orbit has constant and therefore satisfiesThe right side has maximum at . Thus there are two circular orbits when , one marginal orbit at equality, and none above it.
Writing and linearizing givesHence the outer orbit , equivalently , is stable; the inner orbit is unstable. These are the circular-orbit branches of the shifted inverse-radius potential.
To first order in ,The expanded orbit equation is thereforeIts required family of solutions iswith any . Successive periapses occur when changes by , so their angular separation isThe periapsis advance per revolution is consequently .
With total mass , defineThe angular momentum about the centre of mass isExpanding, using and , gives
Each freely moving particle has position, relative to its own initial radial and tangential unit vectors,Thus all particles lie on a circle of radiusTheir angular momenta are constant and sum toSince , the angular velocity isWith ,This is the geometry of a freely expanding rotating particle ring.
At time , the remaining water has angular momentumDuring , the ejected mass is , and its signed tangential speed in the inertial frame is . Conservation of angular momentum gives, to first order,After simplification, the angular rocket equation isHere is signed relative to the direction of rotation; reversing the spray changes its sign.
The four-momentum of a massive particle iswhile for a massless particleFor , invariance givesIn the rest frame of particle 1, , sowith . Equal and opposite final momenta are real exactly whenthe threshold condition for a relativistic two-body decay.
Articles were limited to the first 100 out of 102 total.
Articles by others on the same topic
There are currently no matching articles.