How many voters are needed for paradoxes?

This paper presents a general procedure for finding profiles with the minimum number of voters required for many important paradoxes. Borda's and Condorcet's classic examples are revisited as well as generalizations. Using Saari's procedure line, we obtain an upper bound for the minimum number of voters needed for a profile for which the Condorcet winner is not strictly top ranked for all $w_{\rm s}^{3}$ weighted positional procedures. Also we give a simple upper bound on the minimum number of voters needed for a set of prescribed voting outcomes. In contrast to situations wherein small numbers of voters are needed, we consider paradoxes requiring arbitrarily large numbers of voters as well as large numbers of alternatives. Finally we indicate connections with statistical rank based tests.