Question 327: A Modular Inverse Exists Exactly for a Unit

Original question and givens

Use the original signed integer a=3 and modulus n=28≥2. Exact extended Euclid gives nonnegative g=gcd(a,n) and signed coefficients x,y satisfying a*x+n*y=g. An inverse exists exactly when g=1; normalize its representative to 0≤inverse<n. Uniqueness means one residue class modulo n, not a unique integer representative. This family excludes moduli 0 and 1 and does not use approximate division. Give (a,n,gcd,exists?,inverse), with inverse=null for a nonunit.

• G001 — Use the original signed integer a=3 and modulus n=28≥2. Exact extended Euclid gives nonnegative g=gcd(a,n) and signed coefficients x,y satisfying a*x+n*y=g. An inverse exists exactly when g=1; normalize its representative to 0≤inverse<n. Uniqueness means one residue class modulo n, not a unique integer representative. This family excludes moduli 0 and 1 and does not use approximate division. Give (a,n,gcd,exists?,inverse), with inverse=null for a nonunit.

Definition and scope

Integer a and modulus n≥2. An inverse exists exactly when gcd(a,n)=1; normalize the representative into [0,n).

• mko-modular-inverse

Step-by-step derivation

a=3; n=28≥2

compute gcd and a Bezout certificate before inversion

divide 3 by 28

3=0·28+3

divide 28 by 3

28=9·3+1

divide 3 by 1

3=3·1+0

a·x := mul(3, -9)

a·x = -27

n·y := mul(28, 1)

n·y = 28

Bezout value := sum(-27, 28)

Bezout value = 1

3·(-9)+28·(1)=1

inverse representative=19; 3·19≡1 (mod 28)

Reverse checks

• S008 · premise_and_result_audit — Check integer identities, remainder bounds and gcd conditions; congruence is not integer equality.
• S007 · premise_and_result_audit — Recompute Bezout value with exact rational arithmetic, not rounded decimals.
• S006 · premise_and_result_audit — Recompute n·y with exact rational arithmetic, not rounded decimals.
• S005 · premise_and_result_audit — Recompute a·x with exact rational arithmetic, not rounded decimals.
• S004 · premise_and_result_audit — Check integer identities, remainder bounds and gcd conditions; congruence is not integer equality.
• S003 · premise_and_result_audit — Check integer identities, remainder bounds and gcd conditions; congruence is not integer equality.
• S002 · premise_and_result_audit — Check integer identities, remainder bounds and gcd conditions; congruence is not integer equality.
• S001 · premise_and_result_audit — Check integer identities, remainder bounds and gcd conditions; congruence is not integer equality.

Result

(3, 28, 1, Yes, 19)

The full substitutions and premise audits recover the original answer, retaining its field order and verdict meanings.

This question review and source binding

Review date: 2026-10-26

Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.