The Erdős–Anning theorem is a result in the field of combinatorial number theory, particularly concerning sequences of integers and their properties regarding sums and subsets. Specifically, the theorem addresses the characterization of sequences that can avoid certain types of linear combinations.
New to topics? Read the docs here!