Numerator Created 2026-10-14 Updated 2026-10-20
The numerator is the upper entry in a fraction .
p-adic absolute value Created 2026-09-24 Updated 2026-10-14
Fix a prime number . Write a nonzero rational number as , where and the nonzero integers are not divisible by . The exponent is uniquely determined. Its P-adic valuation is this signed exponent : equivalently, for any nonzero integer numerator and denominator ,
Factors of in the numerator decrease the p-adic absolute value; factors in the denominator increase it. For the computations are:
Rational number FactorizationP-adic valuation 2-adic absolute value
Not applicable by convention
This is an absolute value on a field measuring divisibility, rather than the magnitude on a real number number line. It satisfies
The proof comes directly from P-adic valuations: exponents add in a product of numbers, and extracting a common power of from a sum gives . If the two P-adic valuations differ, the remaining term with smaller exponent cannot cancel modulo , so equality holds. Thus the p-adic absolute value is a Non-Archimedean absolute value. [ref]
The metric makes two rational numbers close when their difference contains a high power of . This packages successive modular congruences into a numerical error estimate, allowing convergence in a metric space and convergent series to encode exact arithmetic information.
p-adic unit Created 2026-09-24 Updated 2026-10-14
A p-adic unit is an invertible element of the ring . For a p-adic integer , this is equivalent to , , or a nonzero initial p-adic digit . A rational number is a p-adic unit when neither its reduced numerator nor its denominator is divisible by .
Thus and are p-adic units at , while is a p-adic integer with no inverse inside . The modular inversion converges to a p-adic inverse construction computes the inverse of an integer unit to arbitrary finite precision.
Continue the transmission amplitude to complex wavenumber with , equivalently complex momentum . Then . In the left exterior region the term grows at negative infinity and the term decays; in the right exterior region the term grows and the term decays. A bound state thus requires , with nonzero . The transfer matrix relation gives . Equivalently, a zero of the incoming coefficient is a bound-state pole of , whose numerator is nonzero at .
The denominator found in part (c) gives
Factorization produces two branches. To identify their parity, use an even interior wavefunction or an odd interior wavefunction for , joined to a decaying exterior wavefunction at . Continuity and the derivative jump give, respectively,
Rearrangement gives the implicit energy eigenvalue equations
Only strictly positive equation roots are retained. With , the even equation root lies above and the odd equation root, when it exists, lies below , so the even bound state has lower energy. The formal zero equation root in the odd equation does not itself establish a normalizable wavefunction.
With as in i, the foot of a perpendicular lies strictly between the endpoints precisely when . Since the denominator is positive, this gives
Equivalently, both dot products
are positive: the angles of the triangle at and are both less than . If “between” includes the endpoints, replace both strict inequalities by non-strict ones; equality gives or .
Write , with because the triangle is nondegenerate. Let be its circumcenter. Equality of the complex modulus values gives . Equality of , after expanding the squares, gives
Thus the real part and imaginary part determine
Using the complex conjugate , we also have
Therefore
The nonzero denominator is exactly the nondegeneracy condition. If is real, the three distinct collinear points do not have a finite circumcenter.
Assume . The velocity in polar coordinates is . Hence
Taking the dot product of the conserved Laplace-Runge-Lenz vector with gives
Consequently the polar equation of a conic is
Only angles for which the denominator is positive describe the physical trajectory. Its eccentricity is , giving an ellipse, parabola, or hyperbola when this ratio is respectively less than, equal to, or greater than .
If , the angle is undefined, but the same dot product identity gives the circular orbit . If , the trajectory is radial and the displayed division degenerates; for , and on a fixed ray, so the identity does not determine as a function of a varying angle.
Perfection quotient Created 2026-10-20 Updated 2026-10-25
The ratio of the sum of the positive divisors of a positive integer to that integer. For coprime , the ratio is multiplicative because the divisor function is multiplicative. The contribution of a prime power is , so a prescribed quotient can be searched through its remaining numerator and denominator.
Polar equation of a conic Created 2026-10-25 Updated 2026-10-31
A conic section with a focus of a conic at the origin has the polar coordinates equation , where is the semilatus rectum and the eccentricity. The directrix of a conic definition gives the formula with when ; is the circle limit. The cases , , and give an ellipse, parabola, and hyperbola. The physical radius requires a positive denominator. For an attractive inverse-square central force, the Laplace-Runge-Lenz vector gives and .
Proper fraction 2026-10-31
A nonnegative fraction with positive denominator and numerator smaller than its denominator, so its value lies in . The zero value has the reduced fraction representation . The term is sometimes extended to negative fractions by comparing absolute values; the nonnegative convention is the one used here.
Rational arithmetic 2026-10-20
Exact arithmetic on rational numbers represented by integer numerators and nonzero integer denominators. Common factors can be removed with the greatest common divisor. Exact rational arithmetic avoids rounding error when deciding equality or integrality.
Rational number Created 2026-09-24 Updated 2026-10-20
Reduced fraction Created 2026-10-06 Updated 2026-10-07
A reduced fraction has coprime integers and positive denominator . Distinct reduced fractions with denominators at most differ by at least , since their difference has a nonzero integer numerator over a denominator at most .
Semiconvergent 2026-10-20
Given consecutive continued fraction convergents and , the intermediate fractions for are semiconvergents, where is the next partial quotient. The endpoint is the next convergent. These fractions matter in best rational approximation when a denominator bound cuts between consecutive convergents.
Stern-Brocot tree 2026-10-20
A binary tree enumerating every positive reduced fraction exactly once. Begin with boundary fractions and ; between neighboring fractions , insert their mediant and recurse into the two new intervals. The determinant relation is preserved, and the new denominator is .
Unit fraction Created 2026-10-20 Updated 2026-10-31
A fraction of the form for a positive integer . Its numerator is 1 and its denominator determines it uniquely.
Consider an original abstract data type whose values are rational numbers. Store an ordered pair of integers, interpreted as a numerator and a denominator. Use exact, unbounded integer arithmetic in this model. The storage space, representation invariant and abstraction function are
The representation invariant does not require a positive denominator or a reduced fraction. Consequently , and are three different concrete states with the same abstract rational number . Similarly, and both represent zero. The abstraction function is a surjection: every rational number has an integer numerator and a nonzero integer denominator, so every abstract value has a representation.
Figure 1.
Several valid integer pairs represent one rational value; zero denominators have no abstract value
. Details.
Both and violate the representation invariant; neither has a value under this abstraction function. By contrast, is completely valid. Simplifying it to the reduced fraction may be a useful implementation choice, but is not a requirement of this representation. Strengthening the representation invariant to require a positive denominator and a greatest common divisor of one would choose a unique stored representative for each rational number; every constructor and operation would then need to establish that stronger condition.
Equality of abstract values is therefore different from equality of stored ordered pairs. For valid and ,
This defines an equivalence relation on : each equivalence class contains all representations of one rational number. An API equality operation can compare these cross-products using exact integer arithmetic. Comparing the two fields individually would incorrectly declare and unequal as rational numbers. The general reason is that an abstraction function may map several concrete values to one abstract value.[ref]