proposition: Lemma root1 x : ~~ root 1 x.
proof: Proof. by rewrite rootC oner_eq0. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq choice) mathcomp(fintype bigop finset tuple) mathcomp(div ssralg countalg binomial)