Infinitude of Primes Using Formal Language Theory
Formal Languages and Automata Theory
2020-05-22 v1 Number Theory
Abstract
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.
Cite
@article{arxiv.2005.10372,
title = {Infinitude of Primes Using Formal Language Theory},
author = {Aalok Thakkar},
journal= {arXiv preprint arXiv:2005.10372},
year = {2020}
}