Cameron's Sum-Free Set Constant

A set of Positive Integers is sum-free if the equation has no solutions , ,. The probability that a random sum-free set consists entirely of Odd Integers satisfies

References

Cameron, P. J. ``Cyclic Automorphisms of a Countable Graph and Random Sum-Free Sets.'' Graphs and Combinatorics 1, 129-135, 1985.

Cameron, P. J. ``Portrait of a Typical Sum-Free Set.'' In Surveys in Combinatorics 1987 (Ed. C. Whitehead). New York: Cambridge University Press, 13-42, 1987.

Finch, S. ``Favorite Mathematical Constants.'' http://www.mathsoft.com/asolve/constant/cameron/cameron.html

• Isovolume Problem
• Isthmus
• Iterated Exponential Constants
• Iterated Function System
• Iterated Radical
• Iteration Sequence
• Itô's Lemma
• Itô's Theorem
• Iverson Bracket
• Iwasawa's Theorem
• j
• Jackson's Difference Fan
• Jackson's Identity
• Jackson's Theorem
• Jacobi Algorithm
• Jacobian
• Jacobian Conjecture
• Jacobian Curve
• Jacobian Determinant
• Jacobi-Anger Expansion
• Jacobian Group
• Jacobi Differential Equation
• Jacobi Differential Equation (Calculus of Variations)
• Jacobi Elliptic Functions
• Jacobi Function of the First Kind