proposition: Lemma nth_belast_max (I : eqType ) (l : seq I) i j n : n.+1 < size l -> nth i (belast j l) n.+1 = nth i l n.
proof: Proof. elim: l n j => [n j /=|a l IH n j /=]; first by rewrite nth_nil. by case: n => [|n /IH-> //]; case: (l). Qed.
imports: mathcomp(all_ssreflect all_fingroup all_field) mathcomp(ssralg finalg poly polydiv zmodp vector qpoly) more_thm rootn lcm_lbound