Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.soft-sys.math.mathematica > #16597
| From | John Doty <noqsiaerospace@gmail.com> |
|---|---|
| Newsgroups | comp.soft-sys.math.mathematica |
| Subject | Re: Possible bug in Floor function? |
| Date | 2014-03-02 06:50 +0000 |
| Message-ID | <leukci$sfv$1@smc.vnet.net> (permalink) |
| References | <20140215090214.8888569D4@smc.vnet.net> <lec9gg$l53$1@smc.vnet.net> |
| Organization | Time-Warner Telecom |
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?
Back to comp.soft-sys.math.mathematica | Previous | Next — Previous in thread | Find similar
Re: Possible bug in Floor function? Itai Seggev <itais@wolfram.com> - 2014-02-23 07:54 +0000 Re: Possible bug in Floor function? John Doty <noqsiaerospace@gmail.com> - 2014-03-02 06:50 +0000
csiph-web