Theorems · Theorem · number theory
Nat.exists_mul_mod_eq_gcd
∀ {k n : ℕ}, n.gcd k < k → ∃ m < k, n * m % k = n.gcd k- Defined in
- Mathlib.Data.Int.GCD
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 49 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- LT.lt.ne'proof · cited by 1,417
- Nat.gcdAproof · cited by 23
- Nat.gcdBproof · cited by 21
- Nat.gcd_eq_gcd_abproof · cited by 13
- Int.natCast_modproof · cited by 4
Cited by1
Results whose statement or proof uses this declaration.
- Nat.exists_mul_mod_eq_one_of_coprimeproof · cited by 4