I was doing timing on the same task and found that one system (used for celestial mechanics) was spectacularly fast on a test just like this one. One reason was that it first changed f*(f+1) to
f^2 +f and was clever in computing f^2. You should be clever at this too. Anyway, be careful when you are testing. On Saturday, September 2, 2017 at 2:36:05 AM UTC-7, parisse wrote: > > FYI, this test takes a few seconds with the following giac script (6.2s on > my Mac with 1 thread): > threads:=1; n:=30; > f := symb2poly((1 + x + y + z+t)^n,[x,y,z,t]):; > time(p:=f*(f+1)); > > -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
