We present an elementary proof of the prime number theorem. The relative
error follows a golden ratio scaling law and respects the bound obtained from
the Riemann's hypothesis. The proof is derived in the framework of a scale free
nonarchimedean extension of the real number system exploiting the concept of
relative infinitesimals introduced recently in connection with ultramemtric
models of Cantor sets.