In number theory we have so-called explicit formula's in terms of the Riemann zeta zero's. For instance to count the sum of the logarithms of the primes below some given integer.
(second Chebyshev Function)
Consider the floor function : http://mathworld.wolfram.com/FloorFunction.html
Is there an explicit formula for it consisting of elementary functions?
If not, why not?
Maybe in terms of the zero's of another special function?
I don't think your going to find an explicit formula for the floor function and here is why,
$nextprime(n)= 1+\sum_{j=1}^{2n}\lfloor\frac{n!^j}{j!}\rfloor-\lfloor\frac{n!^j-1}{j!}\rfloor$
$prevprime(n)=n+1-\sum_{j=1}^{n}\lfloor\frac{j!^{n-1}}{(n-1)!}\rfloor-\lfloor\frac{j!^{n-1}-1}{(n-1)!}\rfloor$
Greatest prime factor of $n$ $=n+1-\sum_{j=1}^{n}\lfloor\frac{j!^n}{n}\rfloor-\lfloor\frac{j!^n-1}{n}\rfloor$
Smallest prime coprime to $n=1+\sum_{j=1}^{n}\lfloor\frac{n^j}{j!}\rfloor-\lfloor\frac{n^j-1}{j!}\rfloor$
I mean the list goes on and on. If there were an explicit formula for the floor function, any thing having to do with primes would have a solution. Let me know if you find it. (: