Thread
:
Proof for nonexistence of a prime counting function?
View Single Post
Mar25-06, 07:19 PM
#
14
Loren Booda
I'll give it a try:
Iterative functions f
n
, f
n+1
, f
n+2
... can be described by f
n+1
=g[f
n
] where g represents a function.