On Mar 31, 5:05 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> then it is impossible to have better complexity
> than linear in n, ...
that's true, but it is still possible to sum faster than linear -
using closed sum formulas (gosper factorization, zeilberger
algorithm,...)
so, the examples above would translate to simple formulas, just using
first and last value, and stepsize or number of elements, but i think
that's a bit outside the box ;)
h
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---
