Sum-free set
id:
sum-free-set-313-10638597
title:
Sum-free set
text:
In additive combinatorics and number theory, a subset A of an abelian group G is said to be sum-free if the sumset A + A is disjoint from A. In other words, A is sum-free if the equation a + b = c has no solution with a , b , c ∈ A . For example, the set of odd numbers is a sum-free subset of the integers, and the set {N + 1, ..., 2N } forms a large sum-free subset of the set {1, ..., 2N }. Fermat's Last Theorem is the statement that, for a given integer n > 2, the set of all nonzero nth powers
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Sum-free_set
date created:
date modified:
2023-01-08T23:25:27Z
main entity:
{"identifier":"Q3054917","url":"https://www.wikidata.org/entity/Q3054917"}
image:
fields total:
13
integrity:
13