Linear support for the prime number sequence and the first and second Hardy-Littlewood conjectures

Servais and Grün used results about linear support for the prime number sequence to obtain upper bounds on the smallest prime in odd perfect numbers. This was extended by Cohen and Hendy who proved that for every n ∈ N there exists an integer bₙ such that pᵢ ≥ p₁ + ni - bₙ for any sequence (pᵢ) of odd primes, and found minimal values of bₙ for 3 ≤ n ≤ 5, and conjectured minimal values for 6 ≤ n ≤ 10. We give a new proof of the existence of bₙ and the values for 3 ≤ n ≤ 5. We also show that if we assume that the second Hardy-Littlewood conjecture, π (a+b) ≤ π (a) + π (b) for a, b ≥ 2, is true, then we can in a finite number of steps determine numbers, Tₙ, that give quite close bounds for the values of bₙ, namely Tₙ ≤ bₙ ≤ Tₙ + n - 2, and determine the values of Tₙ for 6 ≤ n ≤ 20. We also consider the question of whether the values of bₙ can be replaced by smaller numbers if we assume that p₁ > 3. We will show that if we assume that the first Hardy-Littlewood conjecture is true, then we can determine the minimum such values, aₙ, for 3 ≤ n ≤ 5. We also determine some lower bounds for aₙ for n ≥ 6. It is well-known that the two Hardy-Littlewood conjectures are mutually exclusive, but we never use both conjectures simultaneously. These results give us the upper bound p₁<n/2ⁿ-1t+bₙ on the smallest prime in odd perfect numbers, where t is the number of distinct primes dividing the odd perfect number. This bound was also found by Cohen and Hendy, but we improve the constants bₙ.