Premium
Representations of integers as the sum of k terms
Author(s) -
Erdös Paul,
Tetali Prasad
Publication year - 1990
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.3240010302
Subject(s) - natural number , mathematics , basis (linear algebra) , natural density , order (exchange) , combinatorics , set (abstract data type) , discrete mathematics , computer science , geometry , finance , economics , programming language
A set of natural numbers is called an asymptotic basis of order k if every number (sufficiently large) can be expressed as a sum of k distinct numbers from the set. in this paper we prove that, for every fixed k , there exists an asymptotic basis of order k such that the number of representations of n is Θ(log n ).
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom