Reducible sums and splittable sets

DOI10.1016/0022-314X(90)90007-EMaRDI QIDQ752056zbMATH OpenOpenAlexFDO

Authors Abraham Zaks, P. Erdős

Publication date 1990

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-314x(90)90007-e

zbMATH Keywords

reducible sumssplittable setssum of fractions of positive integers

Mathematics Subject Classification ID

Sequences and sets (11B99)

Review text

For \(a_i,n_i\in {\mathbb{N}}\), \(i=1,...,k\) set \(s=\sum^{k}_{i=1}a_i/n_i\). If \(s'=\sum^{k}_{i=1}a_i'/n_i\), \(0\leq a_i'\leq a_i\), then \(s'\) is called a subsum of s. Further, s is called reducible if a subsum \(s'=1\) exists. The set \(\{n_1,...,n_k\}\) is called splittable iff whenever s is an integer greater than 1, then \(s\) is reducible. - In the paper criteria for reducibility and examples of irreducible sums are given. Further, relations between nonsplittable sets and irreducible sums are studied.

Recommendations

• A note on the sum of reciprocals
• Sommes de sous-ensembles
• On additive and multiplicative decompositions of sets of integers with restricted prime factors. II: Smooth numbers and generalizations
• A way to remove duplication from \(\sum_{i=1}^ N 1/x_ i\)
• On Number of Integers Representable as Sums of Unit Fractions

Cites work

• Half factorial domains
• Half-factorial-domains

Cited in

(5)

• On the maximal cardinality of half-factorial sets in cyclic groups
• Erdős-Zaks all divisor sets.
• Sumterms, summands, sumtuples, and sums and the meta-arithmetic of summation
• Weakly half-factorial sets in finite abelian groups
• EZADS inputs which produce half-factorial block monoids.

This page was built for publication: Reducible sums and splittable sets

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