proposition: Lemma like_fib_mul F c: like_fib F -> like_fib (fun n => c * F n).
proof: Proof. by move => h n; rewrite -mulnDr h. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq path fintype div bigop binomial) mathcomp(prime finset ssralg ssrnum ssrint)