proposition: Lemma sternD_consecutive_coprime1 i n (S := stern11 n): i < 2^n -> coprime (nth 0 S i)(nth 0 S i.+1).
proof: Proof. by move => h; rewrite /coprime (sternD_gcd_rec2 1 1 h). 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)