--- Sebastian Martin <sebi_sebi@...
> Hello all:
> you can see my article about prime numbers at:
> and other formulas at:
> Any comment or improvements will be welcome.
What computatioal complexity do algorithms based on your formulae have?
For example, what's the point in replacing the sigma0 function with a sum
that has exponential complexity? And what's the point in performing that sum
repeatedly inside another expression whose number of terms is exponential in
the side of the problem size?
"The hottest places in Hell are reserved for those who, in
times of moral crisis, preserved their neutrality."
-- John F. Kennedy, 24 June 1963, claiming to quote Dante,
to whom this has been incorrectly attributed ever since.
Do You Yahoo!?
Yahoo! Finance - Get real-time stock quotes