proposition: Lemma prim1rootP n : (n > 0)%N -> n.-primitive_root (prim1root_ n).
proof: Proof. by case: n => [|n]// _; rewrite /prim1root_; case: C_prim_root_exists. Qed.
imports: HB(structures) mathcomp(all_ssreflect all_fingroup all_algebra) mathcomp(all_solvable all_field polyrcf) Abel(various classic_ext map_gal algR) Abel(char0 cyclotomic_ext real_closed_ext)