KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesRational ReconstructionEngineering · Engineering MathematicsLesson 561/887← PrevNext →
GuidePublished 7 Aug 2026Updated 13 Aug 20268 min readBy Kevin Jogin
On this page

Ask about this page

KEVOS AIRational Reconstruction

KEVOS knowledge first · trusted web sources when needed

Engineering  /  Mathematics  — Integer Algorithms

Rational Reconstruction

Recovering a rational number from its residue modulo n, the uniqueness conditions, and the role of the extended Euclidean algorithm.

Page KV-MATH-0330Reading time 4 minReviewed 2026-08-07Author Kevin Jogin

Executive summary

Rational reconstruction inverts the map that sends a fraction to its residue modulo n. Given the residue and size bounds on numerator and denominator, the fraction is recoverable and unique.

The mechanism is the extended Euclidean algorithm halted partway: the intermediate remainders and coefficients supply exactly the numerator and denominator sought.

Learning objectives

  1. State the reconstruction problem and its uniqueness condition.
  2. Use a truncated extended Euclid run to solve it.
  3. Apply the method to exact rational linear algebra.

01The problem

Definition

Rational reconstruction

Given integers n and a, and bounds r, s with 2rs < n, find integers x, y with

x ≡ a y (mod n),   |x| < r,   0 < y ≤ s,   gcd(y, n) = 1.

The fraction x/y is then the unique rational of that size congruent to a.

Theorem

Uniqueness

If a solution exists with 2rs < n, it is unique up to a common factor.

Reason. Two solutions would give x₁y₂ ≡ x₂y₁ (mod n), and both sides are bounded in absolute value by rs < n/2, so the congruence forces equality.

Note
The condition 2rs < n is the information-theoretic requirement, not an artefact of the algorithm. There are about 2rs fractions in the allowed range and only n residues, so uniqueness fails as soon as the counts cross.

02The algorithm

Run extended Euclid on (n, a) and stop at the first remainder below the bound r. The remainder and the accumulated coefficient at that point are the numerator and denominator.

Algorithm

Rational reconstruction

Inputn, a, bounds r and s with 2rs < n
Outputthe rational x/y congruent to a mod n, or failure
  1. Initialise (r₀, t₀) = (n, 0) and (r₁, t₁) = (a, 1).
  2. While r₁ ≥ r:
  3.   Compute q = r₀ div r₁.
  4.   Set (r₀, r₁) = (r₁, r₀ − q r₁) and (t₀, t₁) = (t₁, t₀ − q t₁).
  5. Set x = r₁ and y = t₁.
  6. If y < 0, negate both x and y.
  7. If y > s or gcd(y, n) ≠ 1, report failure; else return x/y.
Cost  O(len(n)²) bit operations

The correctness rests on the invariant rᵢ ≡ a tᵢ (mod n), which holds throughout the extended Euclid run. Stopping at the right moment produces a pair where both quantities are small enough.

03Application to exact linear algebra

A linear system with integer coefficients has rational solutions. Solving it modulo a large enough modulus and reconstructing recovers the exact rational answer without ever forming a fraction.

  1. Solve modularly

    Solve the system modulo a prime power or a product of primes, obtaining each component as a residue.

  2. Bound the answer

    Use Cramer's rule and Hadamard's bound to bound the numerators and denominators of the true solution.

  3. Reconstruct componentwise

    Apply rational reconstruction to each residue with those bounds.

  4. Verify

    Substitute the reconstructed solution back into the original system to confirm exactness.

The verification step is worth keeping. Reconstruction can fail silently if the bounds were underestimated, and substitution is a cheap and complete check.

04Frequently asked questions

How is this related to continued fractions?

Closely. The extended Euclid run computes the continued fraction expansion of a/n, and the intermediate pairs are its convergents. Rational reconstruction is the statement that the best rational approximation of bounded denominator is a convergent.

What if no solution exists within the bounds?

Then the residue does not come from a rational of that size, and the algorithm correctly reports failure. In a modular pipeline this signals that more primes are needed to raise the modulus.

Can this recover a rational from a decimal expansion?

The same machinery applies. Given enough digits, continued fraction expansion recovers a rational with small denominator exactly, which is the classical use of the technique.

Related pages

  • The Extended Euclidean Algorithm
  • Speeding Up Algorithms via Modular Computation
  • Rational Reconstruction in Symbolic Algebra

Sources and method

Structural reference: Victor Shoup, A Computational Introduction to Number Theory and Algebra, Version 1, Cambridge University Press, 2005 — book pages 66-70.

This page carries the durable method layer only: definitions, constructions, algorithms, complexity results and selection criteria, authored originally for KEVOS. No text is transcribed or paraphrased from the source, and no numeric tables or benchmark data are reproduced — these are routed to live authoritative sources instead.

Author: Kevin Jogin. Last reviewed 2026-08-07.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Rational Reconstruction. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Rational Reconstruction as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—rational, reconstruction, algorithm, recovering, number—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

  1. Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
  2. Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
  3. Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
  4. Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
  5. Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

StageRecordQuality check
InputObjects, domain, notation, assumptionsEvery symbol is defined
MethodPermitted operation or cited result at each stepAll hypotheses hold
OutputExact result and representationCorrect type, domain and form
VerificationSubstitution, invariant or alternative derivationIndependent agreement
Boundary testZero, identity, degenerate or failed hypothesisScope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

  • Can every symbol be traced to a definition or prior result?
  • Which hypothesis does each major step use?
  • Does the method cover zero, identity, degenerate and boundary cases?
  • Can the conclusion be checked by a second representation or calculation?
  • Are mandatory requirements distinguished from recommendations and illustrative values?
  • Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
  • Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
  • Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Rational Reconstruction?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Which assumption about rational would change the result most if it proved false?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

What evidence would allow an independent reviewer to reproduce or challenge the conclusion?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Which boundary, exception or failure case has not yet been tested?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

What must be handed over, monitored or reviewed after the immediate work is complete?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Authoritative references and use notes

The sources below were selected as institutional or primary guidance for the broader practice. They support the handbook method; they do not imply that every statement or clause in a source applies to every project. Confirm the current edition, jurisdiction, contract and application before treating any requirement as mandatory.

  • MIT OpenCourseWare — Number Theory I — Massachusetts Institute of Technology. Used for algebraic and analytic number theory. Accessed 2026-08-13.
  • MIT OpenCourseWare — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.

Continue learning

Speeding Up Algorithms via Modular ComputationGuide · Engineering MathematicsNEXT LESSON →Rational Reconstruction in Symbolic AlgebraGuide · Engineering MathematicsModular Inverses and Chinese RemainderingGuide · Engineering MathematicsChebyshev's Theorem on the Density of PrimesGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®