File size: 485 Bytes
bff4ec7 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 | import Algorithms.integer_divide.lean.spec_lib
namespace Algorithms.integer_divide.lean
open AUXLib
def FactorizationProgress (original : Int) (factors : List Int)
(remaining candidate : Int) : Prop :=
factors.foldr (· * ·) 1 * remaining = original ∧
Forall prime factors ∧ Sorted (· ≤ ·) factors ∧
Forall (fun factor => factor ≤ candidate) factors ∧
∀ d : Int, 2 ≤ d ∧ d < candidate → ¬ Z.divide d remaining
end Algorithms.integer_divide.lean
|