Infinitude of Primes Using Formal Languages

Aalok Thakkar
2018 The American mathematical monthly  
Formal languages are sets of strings of symbols described by a set of rules specific to them. In this note, we discuss a certain class of formal languages, called regular languages, and put forward some elementary results. The properties of these languages are then employed to prove that there are infinitely many prime numbers.
doi:10.1080/00029890.2018.1496761 fatcat:bql2ofwkcrajlomumcggvxrai4