Infinitude of Primes Using Formal Languages

被引：0
|
作者：
Thakkar, Aalok [1 ]
机构：
[1] Chennai Math Inst, Chennai 603103, India
来源：
AMERICAN MATHEMATICAL MONTHLY | 2018年 / 125卷 / 08期
关键词：
D O I：
10.1080/00029890.2018.1496761
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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.
引用
收藏
页码：745 / 749
页数：5
相关论文
共 50 条
12345