Path: csiph.com!newsfeed.hal-mli.net!feeder3.hal-mli.net!newsfeed.hal-mli.net!feeder1.hal-mli.net!newsfeed.xs4all.nl!newsfeed2.news.xs4all.nl!xs4all!newsgate.cistron.nl!newsgate.news.xs4all.nl!post.news.xs4all.nl!not-for-mail Return-Path: X-Original-To: python-list@python.org Delivered-To: python-list@mail.python.org X-Spam-Status: OK 0.018 X-Spam-Evidence: '*H*': 0.96; '*S*': 0.00; 'mrab': 0.05; 'float': 0.07; 'string': 0.09; 'formatting': 0.09; 'integers': 0.09; 'pretend': 0.09; 'did.': 0.16; 'formatted': 0.16; 'from:addr:mrabarnett.plus.com': 0.16; 'from:addr:python': 0.16; 'from:name:mrab': 0.16; 'message-id:@mrabarnett.plus.com': 0.16; 'precision.': 0.16; 'received:84.93': 0.16; 'received:84.93.230': 0.16; 'rounding': 0.16; 'wrote:': 0.18; 'all,': 0.19; 'trying': 0.19; 'meant': 0.20; '>>>': 0.22; 'header:User-Agent:1': 0.23; 'certainly': 0.24; 'fraction': 0.24; 'mon,': 0.24; 'header:In- Reply-To:1': 0.27; 'point': 0.28; 'correct': 0.29; 'chris': 0.29; 'am,': 0.29; "i'm": 0.30; 'division': 0.31; 'equality': 0.31; 'occurs': 0.31; 'candidate': 0.34; 'could': 0.34; 'equal': 0.35; 'operations': 0.35; 'received:84': 0.35; 'but': 0.35; 'there': 0.35; "didn't": 0.36; 'similar': 0.36; 'should': 0.36; 'being': 0.38; 'loss': 0.38; 'to:addr:python-list': 0.38; 'pm,': 0.38; 'to:addr:python.org': 0.39; 'ian': 0.60; 'worry': 0.60; "you're": 0.61; 'become': 0.64; 'more': 0.64; 'relatively': 0.65; 'worth': 0.66; 'header:Reply-To:1': 0.67; 'reply-to:no real name:2**0': 0.71; 'jul': 0.74; 'prime': 0.74; 'reply-to:addr:python.org': 0.84; 'subject:results': 0.91; 'imagine': 0.93; '2013': 0.98 X-CM-Score: 0.00 X-CNFS-Analysis: v=2.1 cv=RZapVTdv c=1 sm=1 tr=0 a=0nF1XD0wxitMEM03M9B4ZQ==:117 a=0nF1XD0wxitMEM03M9B4ZQ==:17 a=0Bzu9jTXAAAA:8 a=K2DDQYBT4xIA:10 a=POziZqpqTb0A:10 a=ihvODaAuJD4A:10 a=OUOv7kDek9cA:10 a=8nJEP1OIZ-IA:10 a=EBOSESyhAAAA:8 a=8AHkEIZyAAAA:8 a=qLDMBdlwUyoA:10 a=pGLkceISAAAA:8 a=8xVEZtYp2YKQLGE04JkA:9 a=wPNLvfGTeEIA:10 a=MSl-tDqOz04A:10 X-AUTH: mrabarnett:2500 Date: Mon, 29 Jul 2013 18:04:19 +0100 From: MRAB User-Agent: Mozilla/5.0 (Windows NT 5.1; rv:17.0) Gecko/20130620 Thunderbird/17.0.7 MIME-Version: 1.0 To: python-list@python.org Subject: Re: Unexpected results comparing float to Fraction References: <51f68d9c$0$30000$c3e8da3$5496439d@news.astraweb.com> <51F693B4.9000201@mrabarnett.plus.com> In-Reply-To: Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit X-BeenThere: python-list@python.org X-Mailman-Version: 2.1.15 Precedence: list Reply-To: python-list@python.org List-Id: General discussion list for the Python programming language List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Newsgroups: comp.lang.python Message-ID: Lines: 26 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1375117457 news.xs4all.nl 15928 [2001:888:2000:d::a6]:60426 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:51462 On 29/07/2013 17:40, Ian Kelly wrote: > On Mon, Jul 29, 2013 at 10:20 AM, Chris Angelico wrote: >> On Mon, Jul 29, 2013 at 5:09 PM, MRAB wrote: >>> I'm surprised that Fraction(1/3) != Fraction(1, 3); after all, floats >>> are approximate anyway, and the float value 1/3 is more likely to be >>> Fraction(1, 3) than Fraction(6004799503160661, 18014398509481984). >> >> At what point should it become Fraction(1, 3)? > > At the point where the float is exactly equal to the value you get > from the floating-point division 1/3. If it's some other float then > the user didn't get there by entering 1/3, so it's not worth trying to > pretend that they did. > I thought that you're not meant to check for equality when using floats. > We do a similar rounding when formatting floats to strings, but in > that case one only has to worry about divisors that are powers of 10. > I imagine it's going to take more time to find the correct fraction > when any pair of relatively prime integers can be a candidate > numerator and denominator. Additionally, the string rounding only > occurs when the float is being formatted for display; we certainly > don't do it as the result of numeric operations where it could result > in loss of precision. >