Infinitude of primes using formal languages

DOI10.1080/00029890.2018.1496761zbMATH Open1435.68185DBLPjournals/tamm/Thakkar18arXiv2005.10372OpenAlexW3106154930WikidataQ58123013 ScholiaQ58123013MaRDI QIDQ4685121FDOQ4685121

Authors: Aalok Thakkar 

Publication date: 5 October 2018

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

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.

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

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

Mathematics Subject Classification ID

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

Cites Work

• Theory of computation.
• Title not available (Why is that?)
• On Context-Free Languages
• Linear Automaton Transformations
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding prime divisors of a number without dividing
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)