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.
Articles by others on the same topic
There are currently no matching articles.