Euler's partition theorem
From MaRDI portal
Publication:491772
DOI10.1515/FORMA-2015-0009zbMATH Open1318.05012OpenAlexW2293991084MaRDI QIDQ491772FDOQ491772
Authors: Karol Pąk
Publication date: 19 August 2015
Published in: Formalized Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/forma-2015-0009
Recommendations
Combinatorial aspects of partitions of integers (05A17) Mechanization of proofs and logical operations (03B35) Elementary theory of partitions (11P81)
Cites Work
- Title not available (Why is that?)
- Semantics of MML query -- ordering
- Title not available (Why is that?)
- Formalizing Arrow's theorem
- Preliminaries to classical first-order model theory
- First order languages: further syntax and semantics
- The Editor's Corner: Strings, Substrings, and the `Nearest Integer' Function
- Flexary operations
Cited In (7)
- The minimal odd excludant and Euler's partition theorem
- Euler partition rule
- The complexity of Euler's integer partition theorem
- A note on a finite version of Euler's partition identity
- Readable formalization of Euler's partition theorem in Mizar
- Title not available (Why is that?)
- Euler's partition identity-finite version
This page was built for publication: Euler's partition theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q491772)