Back to Results
First PageMeta Content
Analytic number theory / Arithmetic function / Elliptic functions / Randomized algorithm / Expectation–maximization algorithm / Euclidean algorithm / Mathematical analysis / Mathematics / Modular forms


COMPUTING THE RAMANUJAN TAU FUNCTION DENIS XAVIER CHARLES We show that the Ramanujan Tau function τ(n) can be computed by a randomized algorithm 1 that runs in time O(n 2 + ) for every  > 0 under GRH. The same method
Add to Reading List

Document Date: 2009-07-16 15:38:35


Open Document

File Size: 175,55 KB

Share Result on Facebook
UPDATE