A Partition Problem Original Research Article

For positive integers l, n, k we say that M = M(n, k) = {n, n + 1, ..., n + k} has an l-partition, if there is A subset of M(n, k) with l∑a set membership, variant Aa = ∑m set membership, variant Mm. Moreover, define image(l) = {M(n, k) : M has an l-partition}, and K(l) = minM set membership, variant image(l) (M − 1). We show that M(n, k) set membership, variant image(2) iff k ≡ 3 mod 4 or 2 k, n ≡ k/2 mod 2, 4n ≤ k2. Then we prove an explicit formula for K(pd), where p is prime; finally, we introduce a method of determining K(r) for arbitrary r set membership, variant image, particularly for r = pq with primes p and q.