fact: Fixpoint prime_bool_rec n p : bool := match n with | 0 => true | 1 => true | 2 => true | S (S n') => negb (divides_bool n p) && prime_bool_rec n' p end.
imports: List Arith Lia Bool Permutation Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list utils_nat gcd sums)