On Wednesday 15 July 2009, Santanu Sarkar wrote: > Suppose f=2*x^2+3*x+1 is a polynomial in x. How efficiently we > can calculate f^10 modulo 24?
sage: P.<x> = PolynomialRing(Zmod(24)) sage: f = 2*x^2+3*x+1 sage: type(f) <type 'sage.rings.polynomial.polynomial_zmod_flint.Polynomial_zmod_flint'> sage: %timeit f**10 100000 loops, best of 3: 19 µs per loop Cheers, Martin -- name: Martin Albrecht _pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99 _otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF _www: http://www.informatik.uni-bremen.de/~malb _jab: martinralbre...@jabber.ccc.de --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
