proposition: Lemma lucas_gt0 m: 0 < lucas m.
proof: Proof. by elim:m=> [|[|m] IH] //; rewrite lucasSS addn_gt0 IH. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq path fintype div bigop binomial) mathcomp(prime finset ssralg ssrnum ssrint)