We study Δd(n) = qd(n) −Qd(n),
where qd(n) is the number of partitions of n into parts differing by at least d, and
Qd(n) is the number of partitions of n into parts congruent to 1 or d + 2(modd + 3). We prove that Δd(n) → +∞ with n for d ≧ 4, and that Δd(n) ≧ 0 for all
n if d = 2s− 1,s ≧ 4.