fact: Variable (r n k : nat) (f : nat -> nat) (Hf1 : forall i, i < n -> f i <= k) (Hf2 : forall i j, i < j < n -> f i < f j).
imports: Arith Lia List Bool Undecidability.Shared.Libs.DLW.Utils(utils_tac gcd sums rel_iter bool_nat power_decomp prime)