proposition: Fact divides_bool_spec n p : divides_bool (S n) p = true <-> S n <d p.
proof: Proof. unfold divides_bool. generalize (modS_divide n p). case_eq (p mod S n); try tauto. intros k H1 <-; split; discriminate. Qed.
imports: List Arith Lia Bool Permutation Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list utils_nat gcd sums)