# Erdős–Fuchs theorem

Jump to: navigation, search  Main Article Talk Related Articles  [?] Bibliography  [?] External Links  [?] Citable Version  [?] This editable Main Article is under development and not meant to be cited; by editing it you can help to improve it towards a future approved, citable version. These unapproved articles are subject to a disclaimer. [edit intro]

In mathematics, in the area of combinatorial number theory, the Erdős–Fuchs theorem is a statement about the number of ways that numbers can be represented as a sum of two elements of a given set, stating that the average order of this number cannot be close to being a linear function.

The theorem is named after Paul Erdős and Wolfgang Heinrich Johannes Fuchs.

## Statement

Let A be a subset of the natural numbers and r(n) denote the number of ways that a natural number n can be expressed as the sum of two elements of A (taking order into account). We consider the average The theorem states that cannot hold unless C=0.