... are stated with c = 0, but theproofs of the lower bounds require c to be positive. The construction of n with τ(n, y, z) = r on p. 177 of [43] requires z1r+3+r+1≤ x, but the proof can bemodified ... n, Ω(n) is the number of prime power divisors of n, π(x) is the number of primes ≤ x, τ(n) is thenumber of divisors of n. P(s, t) is the set of positive integers composed of prime factors p satisfying ... function g(n), whichcounts the number of pairs of consecutive divisors d, d of n with d|d(see [11],[12]). The following sharpens Th´eor`eme 2 of [43].INTEGERS WITH A DIVISOR IN AN INTERVAL 377Corollary...