proposition: Lemma lucas5S n: lucas (n+5) = 5 * lucas n.+1 + 3 * lucas n.
proof: Proof. by rewrite addnS lucas_add mulnC (mulnC (lucas n)). Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq path fintype div bigop binomial) mathcomp(prime finset ssralg ssrnum ssrint)