Re: Pattern matching "on the fly"
- To: mathgroup at smc.vnet.net
- Subject: [mg30277] Re: Pattern matching "on the fly"
- From: Hendrik van Hees <h.vanhees at gsi.de>
- Date: Sat, 4 Aug 2001 20:02:05 -0400 (EDT)
- Organization: GSI Darmstadt
- References: <9jtk77$87r$1@smc.vnet.net> <9jvrbe$doi$1@smc.vnet.net> <9kdbfr$f2m$1@smc.vnet.net> <9kg0ep$id0$1@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
Stephen P Luttrell wrote: > Oops. The input was actually > > (1+x)^1000000000000000000000 +O[x]^3//Normal//Timing > > This took "zero" time to evaluate, so we can safely assume that > Mathematica drops the O[x]^3 terms as it goes along. I'm wondering why this should be any problem for Mathematica. It's simply a power series. One can use either binomials or the Taylor expansion to obtain the result Mathematica 4.0 for Students: Linux Version Copyright 1988-1999 Wolfram Research, Inc. -- Motif graphics initialized -- In[1]:= Series[(1 + x)^1000000000000000000000, {x, 0, 3}] Out[1]= 1 + 1000000000000000000000 x + 2 > 499999999999999999999500000000000000000000 x + 3 > 166666666666666666666166666666666666666667000000000000000000000 x + 4 > O[x] given by Mathematica in negligible time. -- Hendrik van Hees Home: http://theory.gsi.de/~vanhees/ c/o GSI-Darmstadt SB3 3.183 FAQ: http://theory.gsi.de/~vanhees/faq/ Planckstr. 1 D-64291 Darmstadt mailto:h.vanhees at gsi.de