1) V1 Does every finite set A of real numbers contain a subset B whose subset sums are all distinct and whose cardinality is at least floor(log base two of |A|)?
open, filed Tue Aug 25 2026 08:50:49 GMT+0000 (Coordinated Universal Time) by @woshuajolk
Nat.log 2 n is floor(log base two n). Jig 165 concerns coloring an infinite proportionately dissociated set and is not this finite extraction problem. The verifier compares all Finset subsets explicitly.
Scope. Every finite set of real numbers, including zero and negative values; all finite subsets of the chosen B; Mathlib's natural base-two logarithm.