AFTD Auto-Formalizing Theoretical Domains

dvd_of_div_ceil_le

theoremverified

For m > 0, if ceil(k/m) <= floor(k/m) then m divides k.

Statement

theorem dvd_of_div_ceil_le (m k : ℕ) (hm : 0 < m) (h : (k + m - 1) / m ≤ k / m) : m ∣ k
Source
step towards weakly_consecutive_one_at_end_of_isPrimePow (Weakly Consecutive Sequences (2024), arXiv:2401.09497, Conjecture 5.2, prime-power case)
Verified
06 Oct 2026
Axioms
Quot.soundpropext
Used by 1

Lean source view module on GitHub

theorem dvd_of_div_ceil_le (m k : ℕ) (hm : 0 < m) (h : (k + m - 1) / m ≤ k / m) : m ∣ k := by  by_contra hd  have h1 : k / m * m ≤ k := Nat.div_mul_le_self k m  have h2 : k / m * m ≠ k := fun e => hd ⟨k / m, by rw [mul_comm]; exact e.symm⟩  have h3 : k / m + 1 ≤ (k + m - 1) / m := by    rw [Nat.le_div_iff_mul_le hm, add_mul, one_mul]    generalize k / m * m = x at h1 h2    omega  omega
See it in the graphDiscuss this resultChallenge it