Testability of positive integers

DOI10.1142/S1793830924500277MaRDI QIDQ6983284zbMATH OpenFDO

Authors Yuxing Yang

Publication date 15 May 2025

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830924500277

zbMATH Keywords

integer partitioninteger representationinteger testabilityrepresentation algorithm

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Other number representations (11A67) Elementary theory of partitions (11P81)

Cites work

• Asymptotic formulae in combinatory analysis.
• Bijective proofs of some classical partition identities
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• On the Partition Function p (n )
• Partitions into \(k\)th powers of terms in an arithmetic progression
• Power partitions
• The development of multiple-valued logic as related to computer science

This page was built for publication: Testability of positive integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6983284)