Ah I see you mistaking p  This count isnt 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 Carmichaels theorem  If F had a characteristic factor then  would be larger by one  Remember that a finite number of prime Fibonaccis 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 opinions based on facts dont have to stay in the proposal  The facts do though which would be the first  lines  If you would like to contribute then you may