On Some Sequences of Integers 论文
1936Journal of the London Mathematical Society引用 320
Matrix Theory and Algorithms
摘要
Abstract. An infinite sequence a1 <a2 <·· · is d-complete if every sufficiently large integer is the sum of ai such that no one divides the other. We investigate d-completeness of sets of the form {p α q β} and {p α q β r γ} with α, β, γ nonnegative. 1.