 Another version of the puzzle is a variant of the inductive form. We know that a sorites series for ‘bald’ contains some numbers of hairs such that men having those numbers of hairs are not bald. By the least number principle (equivalent to the principle of mathematical induction) there must be a least number, say i+1, such that a man with i+1 hairs on his head is not bald. Since a man with 1 hair on his head is bald, it follows that i+1 must be greater than 1. Hence the series contains a number of hairs n (=i) such that a man with n hairs is bald whilst a man with n+1 hairs is not. Let ‘\(\exists n(\ldots n\ldots)\)’ assert that some number n satisfies the condition ...n.... Then we can schematize the latter reasoning this way: