proposition: Lemma mod3_small n: (n %% 3) < 3.
proof: Proof. by rewrite ltn_pmod. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq path fintype div bigop binomial) mathcomp(prime finset ssralg ssrnum ssrint)