We consider the same problem as in Kamiya and Takemura(1997), but for discriminant analysis on(n-1)-dimensional unit sphere S^n-1. That is, we regard pairwise discriminant analysis of m populations on S^n-1 as a process to generate rankings among the populations, and give a formula for the number of generated rankings.