Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #45652 > unrolled thread
| Started by | Steven D'Aprano <steve+comp.lang.python@pearwood.info> |
|---|---|
| First post | 2013-05-21 08:26 +0000 |
| Last post | 2013-05-21 12:17 +0100 |
| Articles | 4 — 4 participants |
Back to article view | Back to comp.lang.python
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
| From | Steven D'Aprano <steve+comp.lang.python@pearwood.info> |
|---|---|
| Date | 2013-05-21 08:26 +0000 |
| Subject | sympy.nsimplify |
| Message-ID | <519b2fa6$0$6574$c3e8da3$5496439d@news.astraweb.com> |
For maths nerds like me, this is too cool for words: http://www.johndcook.com/blog/2013/04/30/recognizing-numbers/ -- Steven
[toc] | [next] | [standalone]
| From | Chris Angelico <rosuav@gmail.com> |
|---|---|
| Date | 2013-05-21 19:08 +1000 |
| Message-ID | <mailman.1914.1369127294.3114.python-list@python.org> |
| In reply to | #45652 |
On Tue, May 21, 2013 at 6:26 PM, Steven D'Aprano <steve+comp.lang.python@pearwood.info> wrote: > For maths nerds like me, this is too cool for words: > > http://www.johndcook.com/blog/2013/04/30/recognizing-numbers/ It is indeed, very cool. I think I need to conjure an excuse to use this someplace. ChrisA
[toc] | [prev] | [next] | [standalone]
| From | Skip Montanaro <skip@pobox.com> |
|---|---|
| Date | 2013-05-21 06:01 -0500 |
| Message-ID | <mailman.1920.1369134110.3114.python-list@python.org> |
| In reply to | #45652 |
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
[toc] | [prev] | [next] | [standalone]
| From | Paul Rudin <paul.nospam@rudin.co.uk> |
|---|---|
| Date | 2013-05-21 12:17 +0100 |
| Message-ID | <87hahweg57.fsf@no-fixed-abode.cable.virginmedia.net> |
| In reply to | #45662 |
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.
[toc] | [prev] | [standalone]
Back to top | Article view | comp.lang.python
csiph-web