Emulating Primality with Multiset Representations of Natural Numbers

DOI10.1007/978-3-642-23283-1_15zbMath1351.11001OpenAlexW58832624WikidataQ60691847 ScholiaQ60691847MaRDI QIDQ3105752

Paul Tarau

Publication date: 6 January 2012

Published in: Theoretical Aspects of Computing – ICTAC 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23283-1_15

zbMATH Keywords

Möbius functionfunctional programmingprime numbersexperimental mathematicsMertens functionautomorphisms of \(\mathbb N\)bijective datatype transformationsmultiset encodings

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Software, source code, etc. for problems pertaining to number theory (11-04) Primes (11A41)

Related Items (1)

Towards a generic view of primality through multiset decompositions of natural numbers

Uses Software

• Haskell
• OEIS

Cites Work

• Thoughts on the Riemann hypothesis
• On interpretations of arithmetic and set theory
• Disproof of the Mertens conjecture.
• Addition and multiplication of sets
• Generating binary trees by transpositions
• The Average Amount of Information Lost in Multiplication
• A Groupoid of Isomorphic Data Transformations
• An Elementary Problem Equivalent to the Riemann Hypothesis
• Mathematical Foundations of Computer Science 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Emulating Primality with Multiset Representations of Natural Numbers