Minimal sufficient sets of colors and minimum number of colors

In this paper, we first investigate the minimal sufficient sets of colors for p=11 and 13. For odd prime p and any p-colorable link L with det L≠0, we give alternative proofs of mincolpL ≥ 5 for p ≥ 11 and mincolpL ≥ 6 for p ≥ 17. We also elaborate on equivalence classes of sets of distinct colors (on a given modulus) and prove that there are two such classes of five colors modulo 11, and only one such class of five colors modulo 13.