Re: Simplify Oddity
- To: mathgroup at smc.vnet.net
- Subject: [mg59404] Re: Simplify Oddity
- From: "Jens-Peer Kuska" <kuska at informatik.uni-leipzig.de>
- Date: Mon, 8 Aug 2005 06:17:07 -0400 (EDT)
- Organization: Uni Leipzig
- References: <dd7337$3q5$1@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
Hi, you mean f1 = g (g/r)^(k - 1); f2 = g^k/r^(k - 1); tmp = f1/f2; (tmp //. (a_*b_)^n_ :> a^n*b^n) //. a_^n_*b_^n_ :> (a*b)^n Regards Jens "AES" <siegman at stanford.edu> schrieb im Newsbeitrag news:dd7337$3q5$1 at smc.vnet.net... | I'm supposing that the following rather odd result has something to do | with Mathematica being concerned that g or r (or k?) might be complex | numbers? | | In[151] := | | f1 = g (g/r)^(k-1); | | f2 = g^k/r^(k-1); | | f1/f2 // FullSimplify | | Out[151] = g^(-k) (g/r)^k r^k | | But shouldn't Mathematic be able to simplify this to unity nonetheless? | -- maybe without even invoking Simplify? |