Re: sympy.nsimplify

From	Paul Rudin <paul.nospam@rudin.co.uk>
Newsgroups	comp.lang.python
Subject	Re: sympy.nsimplify
Date	2013-05-21 12:17 +0100
Message-ID	<87hahweg57.fsf@no-fixed-abode.cable.virginmedia.net> (permalink)
References	<519b2fa6$0$6574$c3e8da3$5496439d@news.astraweb.com> <CAPTjJmrJFy-UmqO5m5zALA0MRRvsCBvAPJnPR2AQ8cxT9jT23A@mail.gmail.com> <mailman.1920.1369134110.3114.python-list@python.org>

Show all headers | View raw

Skip Montanaro <skip@pobox.com> writes:

> Very cool indeed.  In the comments was a link to an XKCD cartoon.  Its
> tool tip mentioned "twin primes".  Looked that up.  Google pointed (of
> course) at Wikipedia.  Read that.  Backed up to the Google Search, and
> noticed there is a news item from 15 hours ago that an unknown
> mathematician at the University of New Hampshire has proven the twin
> primes conjecture:
> http://www.wired.com/wiredscience/2013/05/twin-primes/
>
> This is nothing to do with the original post.  It's just amazing to me
> how short the distance between one very interesting topic on the net
> and something almost unrelated can be.

AIUI the twin primes conjecture hasn't been proved. But a significant
related fact - that there's an infinitude of primes no more that N apart
where N <~ 70,000,000. That might not sound like a lot of progress - but
the point is that the existence of some finite bound is very
significant.

Back to comp.lang.python | Previous | Next — Previous in thread | Find similar | Unroll thread

Thread

sympy.nsimplify Steven D'Aprano <steve+comp.lang.python@pearwood.info> - 2013-05-21 08:26 +0000
  Re: sympy.nsimplify Chris Angelico <rosuav@gmail.com> - 2013-05-21 19:08 +1000
  Re: sympy.nsimplify Skip Montanaro <skip@pobox.com> - 2013-05-21 06:01 -0500
    Re: sympy.nsimplify Paul Rudin <paul.nospam@rudin.co.uk> - 2013-05-21 12:17 +0100

csiph-web