Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

sympy.nsimplify

22 views
Skip to first unread message

Steven D'Aprano

unread,
May 21, 2013, 4:26:14 AM5/21/13
to
For maths nerds like me, this is too cool for words:

http://www.johndcook.com/blog/2013/04/30/recognizing-numbers/



--
Steven

Chris Angelico

unread,
May 21, 2013, 5:08:05 AM5/21/13
to pytho...@python.org
It is indeed, very cool. I think I need to conjure an excuse to use
this someplace.

ChrisA

Skip Montanaro

unread,
May 21, 2013, 7:01:40 AM5/21/13
to Chris Angelico, pytho...@python.org
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.

Skip

Paul Rudin

unread,
May 21, 2013, 7:17:24 AM5/21/13
to
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.
0 new messages