For any m=3(2n+1)with n∈N∗, the prime counting function π(m)=4+∣A4(m)∣+2∣A6(m)∣ where A6(m) and A4(m) are the sets of Twin Primes and “Isolated” Primes, below m, respectively. T(m)=1+∣A2(m)∣+∣A4(m)∣+∣A6(m)∣ is the number of consecutive odd composite numbers (COCONs) below m. A2(m) is the set of COCONs, below m and distant by 2. With m odd, π(m), T(m) and ∣A2(m)∣=2m−9−3∣A6(m)∣−2∣A4(m)∣ lead to 4∣A6(m)∣+7=m−2(T(m)+∣A4(m)∣). Hence 0<1−m2(T(m)+∣A4(m)∣)<1. Thus the non-empty unique set S≡{1−l2(T(l)+∣A4(l)∣) suchthat l=3(2k+1)with k∈N∗}⊂R is bounded. Therefore Inf(S) exists, is unique and finite. By definition, Inf(S)>0. Q dense in R also guarantees the latter. S and Inf(S) are independent of m. We then introduce α=Inf(S): α is independent of m. We then have 0<α≤1−m2(T(m)+∣A4(m)∣) for any m as above. Therefore, 4∣A6(m)∣+7≥αm, with α>0 and independent of m. Hence m⟶+∞lim∣2A6(m)∣=+∞. Similarly, m⟶+∞lim∣A4(m)∣=+∞.