vix.ing · top · new · best · stats · spec

On Some Sequences of Integers

1936/10/01 by Paul Erdös, Paul Erdős, Paul Turán +1 · 26 citations
Computer Science · #Matrix Theory and Algorithms

paper · doi:10.1112/jlms/s1-11.4.261

Abstract

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.

Cited by

Related