 :::::Ah, I see you mistaking πp>=2.  This count isn't just for individual Fp examples that are composite, this rule is for all Fp, with one exception.  Notice that the exception is due to the missing characteristic factor in Carmichael's theorem.  If F(6) had a characteristic factor then π6 would be larger by one.  Remember that a finite number of prime Fibonacci's means an infinite number of composites.  This function reveals that is not possible.  At the very least a new section will be built to show the prime counting function.  The opinion's based on facts don't have to stay in the proposal.  The facts do though, which would be the first 4 lines.  If you would like to contribute then you may.