Infinitude of primes using formal languages

DOI10.1080/00029890.2018.1496761MaRDI QIDQ4685121zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Aalok Thakkar

Publication date 5 October 2018

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2005.10372

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Primes (11A41)

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.

Recommendations

• scientific article; zbMATH DE number 2156418
• scientific article; zbMATH DE number 2226243
• On Furstenberg's proof of the infinitude of primes
• scientific article; zbMATH DE number 575907
• scientific article; zbMATH DE number 57505

Cites work

• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Linear Automaton Transformations
• On Context-Free Languages
• Theory of computation.

Cited in

(6)

• scientific article; zbMATH DE number 4031016 (Why is no real title available?)
• scientific article; zbMATH DE number 7583439 (Why is no real title available?)
• Finding prime divisors of a number without dividing
• scientific article; zbMATH DE number 2226243 (Why is no real title available?)
• scientific article; zbMATH DE number 6994084 (Why is no real title available?)
• Prime factorization of sums and differences of two like powers

This page was built for publication: Infinitude of primes using formal languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4685121)