A partition problem

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 ⊂ M(n, k) with l∑a ∈ Aa = ∑m ∈ Mm. Moreover, define B(l) = (M(n, k) : M has an l-partition), and K(l) = minM ∈ B(l) (|M| - 1). We show that M(n, k) ∈ B(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 ∈ N, particularly for r = pq with primes p and q. © 1994 Academic Press Inc.

Cite

CITATION STYLE

APA

Sander, J. W. (1994). A partition problem. Journal of Number Theory, 48(2), 162–182. https://doi.org/10.1006/jnth.1994.1060

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free