On primitive 3-smooth partitions of n.

MaRDI QIDQ1378490zbMATH OpenFDO

Authors Michael R. Avidon

Publication date 12 February 1998

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/123466, http://www.emis.de/journals/EJC/Volume_4/Abstracts/v4i1r2.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Erdős-Selfridge problemprimitive partitions

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Partitions; congruences and congruential restrictions (11P83)

Review text

Summary: A primitive 3-smooth partition of \(n\) is a representation of \(n\) as the sum of numbers of the form \(2^a 3^b\), where no summand divides another. Partial results are obtained in the problem of determining the maximal and average order of the number of such representations. Results are also obtained regarding the size of the terms in such a representation, resolving questions of Erdős and Selfridge.

Recommendations

• 3-Smooth Representations of Integers
• On a problem of Erdős
• Additive problems with smooth integers
• On practical partitions

Cited in

(1)

• 3-Smooth Representations of Integers

This page was built for publication: On primitive 3-smooth partitions of \(n\).

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