On the Erdős-Straus non-averaging set problem
From MaRDI portal
(Redirected from Publication:1085205)
A set \(S\) of integers is said to be non-averaging if the arithmetic mean of two or more elements of \(S\) does not belong to \(S\). Let \(f(n)\) denote the cardinality of a largest non-averaging subset of \(\{0,1,\ldots,n\}\). The problem of Erdős-Straus is to give upper and lower bounds for \(f(n)\). This paper contains an improvement upon results of E. G. Straus and the author, showing that \(f(n)\gg n^{1/5}\) for all sufficiently large \(n\) and \(f(n)\gg n^{1/5}(\log \log n)^{2/5}\) for infinitely many \(n\).
Recommendations
Cites work
Cited in
(7)- Non-averaging subsets and non-vanishing transversals
- On the lower estimation of non-averaging sets
- On the hardness of finding subsets with equal average
- scientific article; zbMATH DE number 4196054 (Why is no real title available?)
- scientific article; zbMATH DE number 3342854 (Why is no real title available?)
- On Non-Averaging Sets of Integers
- Sharp bound for the Erdős-Straus non-averaging set problem
This page was built for publication: On the Erdős-Straus non-averaging set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1085205)
