Cameron–Erdős conjecture/Definition: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

18 June 2009

  • curprev 10:4310:43, 18 June 2009‎ imported>Jitse Niesen‎ 122 bytes +122‎ The number of sum-free sets contained in {1, 2, …, ''N''} is O(2<sup>''N''/2</sup>).
Retrieved from "https://citizendium.org/wiki/Cameron–Erdős_conjecture/Definition"