proposition: Lemma FM_dodd n: odd (FMd (n.+1)) = odd n.
proof: Proof. by rewrite FM_recd2 oddD odd_double /= oddb. 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)