Emulating primality with multiset representations of natural numbers
DOI10.1007/978-3-642-23283-1_15zbMATH Open1351.11001DBLPconf/ictac/Tarau11OpenAlexW58832624WikidataQ60691847 ScholiaQ60691847MaRDI QIDQ3105752FDOQ3105752
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
Recommendations
functional programmingprime numbersexperimental mathematicsMertens functionautomorphisms of \(\mathbb N\)bijective datatype transformationsMöbius functionmultiset encodings
Functional programming and lambda calculus (68N18) Primes (11A41) Software, source code, etc. for problems pertaining to number theory (11-04)
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Title not available (Why is that?)
- Addition and multiplication of sets
- Generating binary trees by transpositions
- Title not available (Why is that?)
- On interpretations of arithmetic and set theory
- Disproof of the Mertens conjecture.
- Title not available (Why is that?)
- An Elementary Problem Equivalent to the Riemann Hypothesis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Thoughts on the Riemann hypothesis
- On the additive theory of prime numbers
- Mathematical Foundations of Computer Science 2003
- The Average Amount of Information Lost in Multiplication
- A Groupoid of Isomorphic Data Transformations
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (1)
Uses Software
This page was built for publication: Emulating primality with multiset representations of natural numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3105752)
