Re: Possible bug in Floor function?
- To: mathgroup at smc.vnet.net
- Subject: [mg132378] Re: Possible bug in Floor function?
- From: John Doty <noqsiaerospace at gmail.com>
- Date: Sun, 2 Mar 2014 01:06:52 -0500 (EST)
- Delivered-to: l-mathgroup@mail-archive0.wolfram.com
- Delivered-to: l-mathgroup@wolfram.com
- Delivered-to: mathgroup-outx@smc.vnet.net
- Delivered-to: mathgroup-newsendx@smc.vnet.net
- References: <20140215090214.8888569D4@smc.vnet.net> <lec9gg$l53$1@smc.vnet.net>
On Sunday, February 23, 2014 2:54:56 AM UTC-5, Itai Seggev wrote: > No, Floor doesn't use Simplify. It uses adaptive numerical approximation. > > It's just that for your hidden integer, it gets an answer it can verify (on its > > first attempt, no less), whereas for the Log case that started the threade it > > can't verify its answer and defaults to raw machine arithmetic. OK, so that leads to the next question: why doesn't this work for Log[100]/Log[10]? Somewhere it has a mechanism that allows it to verify Log[100]/Log[10]==2, as we see when we apply FullSimplify. Shouldn't it be using that mechanism in this case?