加载中…
A More Sums Than Differences (MSTD) set is a finite set of integers where the cardinality of its sumset, , is greater than the cardinality of its difference set, . We address a problem posed by Samuel Allen Alexander that asks whether there exists an infinite sequence of sets alternating between being MSTD and More Differences Than Sums (MDTS), where each set properly contains the previous. While a companion paper resolved this using filling in' techniques, we solve the more challenging non-filling-in’ version, where any missing integer between a set’s minimum and maximum elements remains missing in all subsequent sets.

生成讲解博客的中文版本

生成AI智能校验的中文版本