proposition: Lemma FM_cdbound n : (FMd n) <= FMc n <= (FMd n) .+1.
proof: Proof. by rewrite FM_recE1 addnC; apply/andP;split; case:odd. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq choice fintype order bigop ssralg) mathcomp(div ssrnum ssrint rat prime path binomial) mathcomp(tuple finset) gaia(fibm)