Hi Guys, Is algorithmic complexity determined mostly for primality tests or on-to prime-generating functions? Say, I have the function, Floor[(n!)/(n+1)], and for every n it produces primes, would I have to use the trig definition of the floor function to determine the complexity of this algorithm. Would it be O(n!)? Now, on the other hand, say, I have the function, Floor[(n!)/(n+1)], where n is an integer that is to be tested for primality, the complexity of this formula is O(n!), right? I would still have to use the trig definition of the floor function, right? Thus rendering this algorithm inefficient because it would take extremely long for the function to test for primality asymptotically. Note that these are purely hypothetical cases. The above function is neither an on-to prime generator nor a primality test. Sorry if this question renders me inexperienced because I am. This is my first experience with number theory and algorithmic complexity.