Documentation

Mathlib.Data.Nat.GCD.Basic

Definitions and properties of Nat.gcd, Nat.lcm, and Nat.coprime #

Generalizations of these are provided in a later file as GCDMonoid.gcd and GCDMonoid.lcm.

Note that the global IsCoprime is not a straightforward generalization of Nat.coprime, see Nat.isCoprime_iff_coprime for the connection between the two.

gcd #

source
theorem Nat.gcd_greatest {a : ℕ} {b : ℕ} {d : ℕ} (hda : d ∣ a) (hdb : d ∣ b) (hd : ∀ (e : ℕ), e ∣ a → e ∣ b → e ∣ d) :
d = a.gcd b

Lemmas where one argument consists of addition of a multiple of the other

source
@[simp]
theorem Nat.gcd_add_mul_right_right (m : ℕ) (n : ℕ) (k : ℕ) :
m.gcd (n + k * m) = m.gcd n
source
@[simp]
theorem Nat.gcd_add_mul_left_right (m : ℕ) (n : ℕ) (k : ℕ) :
m.gcd (n + m * k) = m.gcd n
source
@[simp]
theorem Nat.gcd_mul_right_add_right (m : ℕ) (n : ℕ) (k : ℕ) :
m.gcd (k * m + n) = m.gcd n
source
@[simp]
theorem Nat.gcd_mul_left_add_right (m : ℕ) (n : ℕ) (k : ℕ) :
m.gcd (m * k + n) = m.gcd n
source
@[simp]
theorem Nat.gcd_add_mul_right_left (m : ℕ) (n : ℕ) (k : ℕ) :
(m + k * n).gcd n = m.gcd n
source
@[simp]
theorem Nat.gcd_add_mul_left_left (m : ℕ) (n : ℕ) (k : ℕ) :
(m + n * k).gcd n = m.gcd n
source
@[simp]
theorem Nat.gcd_mul_right_add_left (m : ℕ) (n : ℕ) (k : ℕ) :
(k * n + m).gcd n = m.gcd n
source
@[simp]
theorem Nat.gcd_mul_left_add_left (m : ℕ) (n : ℕ) (k : ℕ) :
(n * k + m).gcd n = m.gcd n

Lemmas where one argument consists of an addition of the other

source
@[simp]
theorem Nat.gcd_add_self_right (m : ℕ) (n : ℕ) :
m.gcd (n + m) = m.gcd n
source
@[simp]
theorem Nat.gcd_add_self_left (m : ℕ) (n : ℕ) :
(m + n).gcd n = m.gcd n
source
@[simp]
theorem Nat.gcd_self_add_left (m : ℕ) (n : ℕ) :
(m + n).gcd m = n.gcd m
source
@[simp]
theorem Nat.gcd_self_add_right (m : ℕ) (n : ℕ) :
m.gcd (m + n) = m.gcd n

Lemmas where one argument consists of a subtraction of the other

source
@[simp]
theorem Nat.gcd_sub_self_left {m : ℕ} {n : ℕ} (h : m ≤ n) :
(n - m).gcd m = n.gcd m
source
@[simp]
theorem Nat.gcd_sub_self_right {m : ℕ} {n : ℕ} (h : m ≤ n) :
m.gcd (n - m) = m.gcd n
source
@[simp]
theorem Nat.gcd_self_sub_left {m : ℕ} {n : ℕ} (h : m ≤ n) :
(n - m).gcd n = m.gcd n
source
@[simp]
theorem Nat.gcd_self_sub_right {m : ℕ} {n : ℕ} (h : m ≤ n) :
n.gcd (n - m) = n.gcd m

lcm #

source
theorem Nat.lcm_dvd_mul (m : ℕ) (n : ℕ) :
m.lcm n ∣ m * n
source
theorem Nat.lcm_dvd_iff {m : ℕ} {n : ℕ} {k : ℕ} :
m.lcm n ∣ k ↔ m ∣ k ∧ n ∣ k
source
theorem Nat.lcm_pos {m : ℕ} {n : ℕ} :
0 < m → 0 < n → 0 < m.lcm n
source
theorem Nat.lcm_mul_left {m : ℕ} {n : ℕ} {k : ℕ} :
(m * n).lcm (m * k) = m * n.lcm k
source
theorem Nat.lcm_mul_right {m : ℕ} {n : ℕ} {k : ℕ} :
(m * n).lcm (k * n) = m.lcm k * n

Coprime #

See also Nat.coprime_of_dvd and Nat.coprime_of_dvd' to prove Nat.Coprime m n.

source
instance Nat.instDecidableCoprime_mathlib (m : ℕ) (n : ℕ) :
Decidable (m.Coprime n)
Equations
source
theorem Nat.Coprime.lcm_eq_mul {m : ℕ} {n : ℕ} (h : m.Coprime n) :
m.lcm n = m * n
source
theorem Nat.Coprime.symmetric :
Symmetric Nat.Coprime
source
theorem Nat.Coprime.dvd_mul_right {m : ℕ} {n : ℕ} {k : ℕ} (H : k.Coprime n) :
k ∣ m * n ↔ k ∣ m
source
theorem Nat.Coprime.dvd_mul_left {m : ℕ} {n : ℕ} {k : ℕ} (H : k.Coprime m) :
k ∣ m * n ↔ k ∣ n
source
@[simp]
theorem Nat.coprime_add_self_right {m : ℕ} {n : ℕ} :
m.Coprime (n + m) ↔ m.Coprime n
source
@[simp]
theorem Nat.coprime_self_add_right {m : ℕ} {n : ℕ} :
m.Coprime (m + n) ↔ m.Coprime n
source
@[simp]
theorem Nat.coprime_add_self_left {m : ℕ} {n : ℕ} :
(m + n).Coprime n ↔ m.Coprime n
source
@[simp]
theorem Nat.coprime_self_add_left {m : ℕ} {n : ℕ} :
(m + n).Coprime m ↔ n.Coprime m
source
@[simp]
theorem Nat.coprime_add_mul_right_right (m : ℕ) (n : ℕ) (k : ℕ) :
m.Coprime (n + k * m) ↔ m.Coprime n
source
@[simp]
theorem Nat.coprime_add_mul_left_right (m : ℕ) (n : ℕ) (k : ℕ) :
m.Coprime (n + m * k) ↔ m.Coprime n
source
@[simp]
theorem Nat.coprime_mul_right_add_right (m : ℕ) (n : ℕ) (k : ℕ) :
m.Coprime (k * m + n) ↔ m.Coprime n
source
@[simp]
theorem Nat.coprime_mul_left_add_right (m : ℕ) (n : ℕ) (k : ℕ) :
m.Coprime (m * k + n) ↔ m.Coprime n
source
@[simp]
theorem Nat.coprime_add_mul_right_left (m : ℕ) (n : ℕ) (k : ℕ) :
(m + k * n).Coprime n ↔ m.Coprime n
source
@[simp]
theorem Nat.coprime_add_mul_left_left (m : ℕ) (n : ℕ) (k : ℕ) :
(m + n * k).Coprime n ↔ m.Coprime n
source
@[simp]
theorem Nat.coprime_mul_right_add_left (m : ℕ) (n : ℕ) (k : ℕ) :
(k * n + m).Coprime n ↔ m.Coprime n
source
@[simp]
theorem Nat.coprime_mul_left_add_left (m : ℕ) (n : ℕ) (k : ℕ) :
(n * k + m).Coprime n ↔ m.Coprime n
source
@[simp]
theorem Nat.coprime_sub_self_left {m : ℕ} {n : ℕ} (h : m ≤ n) :
(n - m).Coprime m ↔ n.Coprime m
source
@[simp]
theorem Nat.coprime_sub_self_right {m : ℕ} {n : ℕ} (h : m ≤ n) :
m.Coprime (n - m) ↔ m.Coprime n
source
@[simp]
theorem Nat.coprime_self_sub_left {m : ℕ} {n : ℕ} (h : m ≤ n) :
(n - m).Coprime n ↔ m.Coprime n
source
@[simp]
theorem Nat.coprime_self_sub_right {m : ℕ} {n : ℕ} (h : m ≤ n) :
n.Coprime (n - m) ↔ n.Coprime m
source
@[simp]
theorem Nat.coprime_pow_left_iff {n : ℕ} (hn : 0 < n) (a : ℕ) (b : ℕ) :
(a ^ n).Coprime b ↔ a.Coprime b
source
@[simp]
theorem Nat.coprime_pow_right_iff {n : ℕ} (hn : 0 < n) (a : ℕ) (b : ℕ) :
a.Coprime (b ^ n) ↔ a.Coprime b
source
theorem Nat.not_coprime_zero_zero :
¬Nat.Coprime 0 0
source
theorem Nat.coprime_one_left_iff (n : ℕ) :
Nat.Coprime 1 n ↔ True
source
theorem Nat.coprime_one_right_iff (n : ℕ) :
n.Coprime 1 ↔ True
source
theorem Nat.gcd_mul_of_coprime_of_dvd {a : ℕ} {b : ℕ} {c : ℕ} (hac : a.Coprime c) (b_dvd_c : b ∣ c) :
(a * b).gcd c = b
source
theorem Nat.Coprime.eq_of_mul_eq_zero {m : ℕ} {n : ℕ} (h : m.Coprime n) (hmn : m * n = 0) :
m = 0 ∧ n = 1 ∨ m = 1 ∧ n = 0
source
def Nat.prodDvdAndDvdOfDvdProd {m : ℕ} {n : ℕ} {k : ℕ} (H : k ∣ m * n) :
{ d : { m' : ℕ // m' ∣ m } × { n' : ℕ // n' ∣ n } // k = ↑d.1 * ↑d.2 }

Represent a divisor of m * n as a product of a divisor of m and a divisor of n.

See exists_dvd_and_dvd_of_dvd_mul for the more general but less constructive version for other GCDMonoids.

Equations
  • One or more equations did not get rendered due to their size.
Instances For
    source
    theorem Nat.dvd_mul {x : ℕ} {m : ℕ} {n : ℕ} :
    x ∣ m * n ↔ ∃ (y : ℕ) (z : ℕ), y ∣ m ∧ z ∣ n ∧ y * z = x
    source
    theorem Nat.pow_dvd_pow_iff {a : ℕ} {b : ℕ} {n : ℕ} (n0 : n ≠ 0) :
    a ^ n ∣ b ^ n ↔ a ∣ b
    source
    theorem Nat.coprime_iff_isRelPrime {m : ℕ} {n : ℕ} :
    m.Coprime n ↔ IsRelPrime m n
    source
    theorem Nat.eq_one_of_dvd_coprimes {a : ℕ} {b : ℕ} {k : ℕ} (h_ab_coprime : a.Coprime b) (hka : k ∣ a) (hkb : k ∣ b) :
    k = 1

    If k:ℕ divides coprime a and b then k = 1

    source
    theorem Nat.Coprime.mul_add_mul_ne_mul {m : ℕ} {n : ℕ} {a : ℕ} {b : ℕ} (cop : m.Coprime n) (ha : a ≠ 0) (hb : b ≠ 0) :
    a * m + b * n ≠ m * n
    source
    theorem Nat.dvd_gcd_mul_iff_dvd_mul {x : ℕ} {n : ℕ} {m : ℕ} :
    x ∣ x.gcd n * m ↔ x ∣ n * m
    source
    theorem Nat.dvd_mul_gcd_iff_dvd_mul {x : ℕ} {n : ℕ} {m : ℕ} :
    x ∣ n * x.gcd m ↔ x ∣ n * m
    source
    theorem Nat.dvd_gcd_mul_gcd_iff_dvd_mul {x : ℕ} {n : ℕ} {m : ℕ} :
    x ∣ x.gcd n * x.gcd m ↔ x ∣ n * m
    source
    theorem Nat.gcd_mul_gcd_eq_iff_dvd_mul_of_coprime {x : ℕ} {n : ℕ} {m : ℕ} (hcop : n.Coprime m) :
    x.gcd n * x.gcd m = x ↔ x ∣ n * m