proposition: Lemma lcmnn n : lcmn n n = n.
proof: Proof. by case: n => // n; rewrite /lcmn gcdnn mulnK. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)