![(pdf)](http://s1.studyres.com/store/data/008847675_1-b32b14dcd874f6c04432d18764336f1f-300x300.png)
On the prime counting function and the partial sum of reciprocals of
... then k cannot be a composite. Therefore, k must be a prime. In example 1 page 3, the sorted list L = {85, 87, 91}, this means c1 = 85 is the smallest odd composite that is greater than n = 81. Now since there is a gap between n and c1 wide enough to hold one odd integer, we say that the odd integer ...
... then k cannot be a composite. Therefore, k must be a prime. In example 1 page 3, the sorted list L = {85, 87, 91}, this means c1 = 85 is the smallest odd composite that is greater than n = 81. Now since there is a gap between n and c1 wide enough to hold one odd integer, we say that the odd integer ...