{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2012009","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2012009","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q2012009","kernelVersion":"v1","immutable":true,"modified":"2026-01-23T16:34:41Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q2012009","name":"An effective approach for integer partitions using exactly two distinct sizes of parts","headline":"An effective approach for integer partitions using exactly two distinct sizes of parts","description":"scientific article; zbMATH DE number 6754349","url":"https://portal.mardi4nfdi.de/entity/Q2012009","datePublished":"2017-07-27","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q2012008"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1779478"},{"@id":"https://portal.mardi4nfdi.de/entity/Q372488"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q207920"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.4171/EM/326","url":"https://doi.org/10.4171/EM/326"},"sameAs":["https://doi.org/10.4171/EM/326"],"comment":"Summary: In this paper we consider the number of partitions of a positive integer \\(n\\) into parts of a specified number of distinct sizes. We give a method for constructing all partitions of \\(n\\) into parts of two sizes, as well as an explicit formula to count them with a new self-contained proof. As a side effect, by using the Möbius function we also give a formula for the number of partitions of \\(n\\) into coprime parts."},"provenance":{"prov:generatedAtTime":"2026-01-23T16:34:41Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}