Regular-cusp valence formula on a torsion-free modular curve Created 2026-10-06 Updated 2026-11-05
For a torsion-free effective modular group with genuine, untwisted modular cusp periods, a meromorphic weight- form has integer local orders. The tensor differential has interior order and modular cusp order . Its canonical degree and the genus formula for a modular curve yield the displayed valence formula, with the projective index. Regular modular cusp periods are important in odd weights.
Remainder 2026-10-14
Remainder of a geometric series Created 2026-10-14 Updated 2026-10-20
For , let contain the first terms, with . The remainder after those terms isThis is the exact absolute error. A convenient bound replaces the denominator by , giving through the triangle inequality. The exact denominator is preferable when the sign or complex phase of is known.
For and , the omitted fraction of the entire sum is . Capturing at least percent therefore means . Taking logarithms and applying the ceiling function gives the smallest integer :This gives and terms for and , respectively. The difference is a concrete reason to care about the common ratio, even when all four series converge.
An absolute target has a different scale. For , , and required absolute error at most , the total sum is andThe first acceptable term count is : the remainder is approximately , while at it is approximately . Counting terms and checking the tail avoids an ambiguous instruction to stop when a term merely looks small.
Take a different real matrix,Its only eigenvalue is , with algebraic multiplicity two. However, the polynomial , which vanishes at that eigenvalue, gives . Merely checking values at eigenvalues cannot prove a matrix identity. The full characteristic polynomial does work:The matrix is a Jordan block, and its minimal polynomial is also .
The binomial theorem gives, for positive integers ,Terms containing or a higher matrix power vanish. After removing the common growth factor , the remaining linear map is the shear mapping . It moves to . The single eigenvalue controls the exponential scale, while the nilpotent matrix adds a factor growing linearly in .
Normalized powers of a Jordan block retain a growing shear despite having only one eigenvalue; equal axes scales show the top edge moving by n/2
. Details. In terms of polynomial interpolation, reduction modulo retains both a value and a derivative:Indeed, polynomial division gives . This is a simple Hermite interpolation condition. For , it gives exactly the displayed matrix power. Repeated eigenvalues retain information about how a polynomial changes, not just where it vanishes.
Repeated-message attack on the Rabin cryptosystem Created 2026-10-14 Updated 2026-11-05
For coprime moduli and , the Chinese remainder theorem recovers the integer uniquely in from the two ciphertexts. An ordinary integer square root then recovers the message. If distinct semiprime moduli share a factor, their greatest common divisor instead reveals factors of both moduli. Learning one message in the coprime case does not by itself give a general factoring algorithm or a decryption key for other ciphertexts.
Repeating decimal Created 2026-10-03 Updated 2026-11-05
A repeating decimal has a decimal representation whose digits eventually repeat a finite block. An initial decimal preperiod may occur before the repeated tail: , whereas begins repeating immediately. Terminating expansions fit the same convention by repeating zeros, as in .
A real number is rational exactly when its decimal expansion is eventually periodic. For a rational number, long division has finitely many possible remainders, so it either reaches zero or repeats a previous remainder. Conversely, a repeating tail sums as a geometric series, giving a rational number. The same argument holds in every integer positional base at least two, as in eventually periodic positional expansion of a rational number.
Decimal representations need not be unique: . Both are eventually periodic, so this endpoint ambiguity does not affect the rationality criterion.
Representation theory of SU(2) Created 2026-10-14 Updated 2026-11-05
Finite-dimensional complex representations of are completely reducible, and their irreducibles are indexed by nonnegative integers.
Repunit Created 2026-10-20 Updated 2026-11-05
In a positional notation of integer radix , a repunit is a repdigit whose numerical digits are all . A length- repunit, with , is the geometric seriesFor example, , while . The same string has different values in different radices.
Appending one numerical digit gives . Thus remainders modulo a positive integer obey , starting with . This recurrence relation avoids constructing huge integers. For decimal repunits modulo , the successive remainders are ; hence the six-digit repunit is divisible by .
A repunit divisible by exists exactly when are coprime integers, and one then exists with at most digits. Necessity follows because a common prime factor of divides every nonconstant term of , leaving remainder one. For sufficiency, examine modulo . If none is zero, the pigeonhole principle gives equal remainders at two indices . Their difference is . Cancelling the invertible factor modulo produces a divisible repunit of length .
Residue Created 2026-09-24 Updated 2026-10-13
The residue of a function at an isolated singularity is its Laurent coefficient of degree . More explicitly, if is holomorphic for , write its Laurent series asThis one Laurent coefficient determines the contour integral around a sufficiently small counterclockwise circle about . A complicated local Laurent series can therefore leave a remarkably simple answer after one complete trip around the point.
For a simple pole, multiplying by removes the pole, leaving a holomorphic extension whose value at is the residue:There is a useful shortcut for a quotient . If and are holomorphic near , has a simple zero there, and , then has a simple pole andThe first-order Taylor series of explains the denominator: dividing by leaves its derivative at in the limit. This computes a residue without finding the full Laurent series, which is especially useful when the numerator or denominator is complicated. [ref]
For example, the rational function has simple poles at and . Factoring the denominator makes both residues immediately visible:The signs matter: these residues cancel when both poles are enclosed, but either one contributes when enclosed alone. The residue theorem below turns this distinction into different contour integrals of the same function.
A residue is not the same thing as a pole, nor does it measure the order of a pole. The function has a double pole at zero but residue zero. Conversely,has an essential singularity at zero and residue one. Infinitely many negative powers cause no difficulty in reading off that particular Laurent coefficient. At a removable singularity the residue is zero. [ref]
Why does only this Laurent coefficient survive? Parametrize a counterclockwise circle by , , with . For every integer ,When , the complex exponential completes a whole number of turns and its contributions cancel; when , it is constant. Uniform convergence of the Laurent series on this circle justifies termwise integration, giving . Thus the residue isolates exactly the local information that a closed contour integral detects. [ref]
This selection rule explains why a very large value near an isolated singularity need not produce a large contour integral. The double pole grows faster near zero than , yet its contributions around a circle cancel completely. What matters is the arrangement of complex values along the path, including the differential , rather than their moduli alone. A residue records that surviving contribution, not the size of the function near the point.
Residue class Created 2026-09-24 Updated 2026-10-14
For a positive integer modulus , the residue class of an integer is the equivalence classIt contains all integers in the same position of the repeating cycle. For example,The residue class is this whole infinite collection; its canonical representative is the least nonnegative residue. Euclidean division gives exactly one such representative in , so there are exactly residue classes. When , there is just one, .
Define addition and multiplication of residue classes byThese definitions must give the same answer whichever integers represent the classes. If and modulo , thenBoth differences are divisible by , proving that the operations are well-defined. For example, and , since . Replacing nine by gives the same answers with smaller intermediate integers.
With these operations the residue classes form the finite commutative ring , a quotient ring. It need not be a field: although neither factor is the zero class. These zero divisors explain why division requires a unit modulo n. Reducing after each multiplication is especially useful in modular exponentiation, where the unreduced powers can become enormous.
Resilience of a denominator Created 2026-10-20 Updated 2026-11-05
For an integer , the resilience of a denominator is the fraction of its proper fractions already in lowest terms. The fraction is a reduced fraction exactly when and are coprime, sowhere is Euler's totient function.
For , the allowed numerators are , giving . A prime denominator has resilience one. Conversely, a composite number has a proper prime divisor , and is among the listed fractions but is not reduced; thus its resilience is strictly less than one.
The prime factorization formula givesThe correction comes from sampling the positive proper numerators, rather than all residue classes. The related coresilience uses .
Reversible number Created 2026-10-20 Updated 2026-11-05
A reversible number is a positive integer whose sum with its digit reversal has numerical digits that are all odd integers. Here the radix is ten, and reversing must preserve the digit length: the original number cannot end in zero, because that would create a leading zero after reversal.
For example, , so both and satisfy the rule. The example shows that internal zeros are allowed. In contrast, is excluded by the reversal-length condition, even though has odd digits.
The arithmetic carries couple mirrored digit positions. In , the units sum creates a carry, which makes the next digit . Treating the digit pairs independently would miss this dependence. A counting method can instead track carries from both ends and match them in the middle, avoiding enumeration of every integer of a given length.
Riemannian distance on a circular cylinder 2026-10-14
On the lateral surface of an infinite circular cylinder of radius , the induced metric is . Lifting a curve to the unrolled plane preserves its arc length. If the endpoints differ by angular coordinate and height , the possible lifted endpoint displacements are for integers . Each straight segment gives a geodesic, and the shortest of their lengths isChoose the representative of with smallest absolute value modulo ; if its absolute value is , the two angular directions tie. This minimum is attained because the candidate lengths tend to infinity as . The formula concerns travel on the lateral surface; it does not allow a shortcut through the cylinder's interior or across end caps.
For , take and in surrounding Euclidean space. The angular difference is and height difference is . The route has length . The route goes the other way around and has length . Both are among the geodesics on a circular cylinder, but only the first is a minimizing geodesic between these endpoints.
This is a global consequence of intrinsic flatness of a circular cylinder: locally everything is Euclidean, yet the periodic angular coordinate leaves several competing routes. A shortest-route problem on the curved surface becomes a family of ordinary planar distance calculations.
Ring Created 2026-09-24 Updated 2026-10-14
A ring is a set with two binary operations, addition and multiplication, satisfying three requirements. Under addition, is an abelian group: there is a zero, every element has an inverse element, and grouping or exchanging summands does not change the result. Multiplication is associative and has an identity element , so and . Finally, both versions of the distributive property hold:Here every ring is unital, but the zero ring, with , is allowed. Commutativity of multiplication is an additional condition defining a commutative ring. These conventions agree with [ref].
The integers form a ring with their usual operations. The polynomial ring is another: addition combines coefficients, while multiplication uses the distributive property. For example,The same rules justify symbolic calculations in both rings; this is why one definition can organize apparently different kinds of arithmetic. In every ring, , and . The first identity follows by distributing and subtracting ; the second follows by distributing . Thus familiar sign rules are consequences of the structure.
Order still matters in some rings. In the matrix ring , takeThen matrix multiplication givesNevertheless, matrix multiplication is associative, distributes over addition, and has the identity matrix as its identity element. This is a valid ring. On a column vector, applies first and second: swapping coordinates before discarding the second coordinate differs from doing those actions in reverse. The failure of commutativity records a meaningful difference in function composition.
Two orders of matrix multiplication give different outputs on the same vector
. Details. Ring of integers of Q of square root two Created 2026-09-29 Updated 2026-10-14
Since , the ring of integers of iswith integral basis and field discriminant eight. Multiplication is ordinary polynomial multiplication followed by :For example, and . The integer coefficients stay integral, as required for a ring.
Under the two field embeddings, the element becomes the point . The integral basis vectors become and , giving a Minkowski embedding of a real quadratic field. Their determinant has absolute value , consistent with the field discriminant.
Ring theory 2026-11-05
Ring theory studies rings, their ideals, modules, and structure-preserving ring homomorphisms. It includes both commutative algebra and noncommutative algebra. Here rings are associative and have an identity unless another convention is specified.
The integers are a commutative example. Matrix rings are generally noncommutative: in , while . Thus techniques that reorder scalar factors do not automatically work for matrices.
Quotient rings organize the information lost by a ring homomorphism. If , the first isomorphism theorem for rings identifies with the image of . Studying ideals describes such quotients, while studying modules describes how a ring acts by additive transformations. The two viewpoints connect arithmetic examples with matrix and operator examples.
Robbins bounds for Stirling's formula Created 2026-10-14 Updated 2026-10-18
For every positive integer , Herbert Robbins's bounds giveEquivalently, the remainder in satisfies . This both proves that underestimates and squeezes to one, establishing Stirling's formula. Robbins published the bounds in “A Remark on Stirling's Formula” in 1955. [ref]
https://dornsife.usc.edu/sergey-lototsky/wp-content/uploads/sites/211/2024/02/Stirling-Robbins.pdf. Herbert Robbins, American Mathematical Monthly 62 (1955), pp. 26–29, equations (1)–(2)
For , the relative error of lies strictly between and , approximately and . A bound specifies the accuracy of an approximation before using it in another calculation.
Robin Milner 2026-11-05
Robin Milner presented a polymorphic type discipline and its inference algorithm in 1978. Algorithm W derives types from program structure while using unification to satisfy type constraints; suitable let-bound expressions receive reusable type schemes. This work is a foundation of Hindley-Milner type inference.[ref]
A Theory of Type Polymorphism in Programming by Robin Milner. §4.1, Algorithm W; §4.2, syntactic soundness
For example, an identity function has type . Generalizing a let-bound identity permits separate uses at integer and Boolean types, whereas one lambda-bound parameter has one shared type within its scope. The discipline therefore gives precise rules for reuse rather than treating every occurrence as independently polymorphic. Its type-soundness claim concerns specified runtime type errors, not every possible program failure.
Rodrigues formula for Legendre polynomials Created 2026-10-20 Updated 2026-10-31
This instance of Rodrigues' formula constructs the Legendre polynomial for every nonnegative integer . Put ; then . Differentiating times by the Leibniz rule gives for , which is the Legendre differential equation after reversing signs. The leading term of the normalized derivative is , proving its polynomial degree is exactly . At , the product contributes only the term with all derivatives on the second factor, giving . Thus the normalization is .
Roman numeral Created 2026-10-20 Updated 2026-11-05




