[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index]

RE: [xml-dev] ANN: the first million prime numbers in XML format

*From*:**"=?utf-8?b?Vy4gSHVnaCBDaGF0ZmllbGQ=?=" <csi2000@urbanmarket.com>***To*: Len Bullard <Len.Bullard@ses-i.com>, Mike Sokolov <sokolov@ifactory.com>, "Rushforth, Peter" <Peter.Rushforth@NRCan-RNCan.gc.ca>*Date*: Fri, 06 Jul 2012 11:59:48 -0400

Ah! There are two prequisites to correctly guessing the 7 numbers (i.e. winning the lottery): 1) Have a degree in Physics 2) Only bet on the winning numbers Both are hard to achieve. I have the first. The second may revolve around the 2 solutions to Maxwells equations. One solution is for an e/m signal going forward in time - but - the other is an e/m signal going backward in time (usually ignored by physicists). If you read Gribbins "Schrodinger's Kittens" you can see how treating the second solution as "real" leads to a more satisfying interpretation to Quantum Mechanics than the Copenhagen interpretaton. Now all that is required is figure out an experiment to receive and interpret these backward in time signals. I have been pondering this for a while - and it does look impossible - yet - maybe if we use entanglement. :-) Hugh I once gave a talk to the Ottawa XML Users group called Quantum Infodynamics - but it seems to be no longer online. It was a "light" look at the subject. CyberSpace Industries 2000 Inc. XML Training and Consulting Documentary/Multimedia Productions http://cyberspace-industries-2000.com UBL is in your future: http://goUBL.com On Fri, 6 Jul 2012 15:31:56 0000, "Rushforth, Peter" wrote: I suppose because they're 'hard to guess'. Funny, because I was looking > for a way to guess 7 of 7 numbers drawn at random without replacement > from 49 :-) Oh well. > Peter > > > -----Original Message----- > > From: Len Bullard [mailto:Len.Bullard@ses-i.com] > Sent: July 6, 2012 11:30 > > To: Mike Sokolov; Rushforth, Peter > > Cc: Dimitre Novatchev; Costello, Roger L.; xml-dev@lists.xml.org > > Subject: RE: [xml-dev] ANN: the first million prime numbers > in XML format > > > And cryptographers are fond of them. See RSA encryption. > > > len > > > -----Original Message----- > > From: Mike Sokolov [mailto:sokolov@ifactory.com] > > Sent: Friday, July 06, 2012 10:19 AM > > To: Rushforth, Peter > > Cc: Dimitre Novatchev; Costello, Roger L.; xml-dev@lists.xml.org > > Subject: Re: [xml-dev] ANN: the first million prime numbers > in XML format > > > Oh, Peter. So many things - where to begin? > > > The most basic fact is that every natural number can be > written > as a product of primes in a unique way. This fact is > referred to > as the fundamental theorem of arithmetic. > > > The greatest unsolved problem in mathematics, the Riemann > > hypothesis, can be understood as a statement about the > distribution > of prime numbers. Why is it the greatest > unsolved problem? > Because so many other problems are > equivalent or related to it in > some way, from a great > > > many branches of mathematics. One of my favorite facts about > > primes is that > > > Zeta(s) = Sum (n=1,inf) n^(-s) is = Prod (p prime) 1/(1- p^(-s)) > > > in other words - an infinite sum over all natural numbers is > = > to an infinite product over all the primes. > > > But there are so many really simple things that are special > > about the primes. For example, the Goldbach conjecture: any > even > number can be written as the sum of two primes. So > simple, yet > unproven. Another unproven fact: there are an > infinite number of > prime twins: ie consecutive odd primes. > That is mildly surprising > since primes become less common > (tend to be spaced further apart) > as they get bigger. > > > Sorry to dive deeply off topic, there must be better mailing > > lists for this discussion, but you touched a nerve... > > > -Mike > > > > On 07/06/2012 11:03 AM, Rushforth, Peter wrote: > > > Er, pardon me for asking, but what's so special about prime numbers? > > > > > > Thanks, > > > Peter > > > ________________________________________ > > > From: Dimitre Novatchev [dnovatchev@gmail.com] > > > Sent: July 6, 2012 12:39 AM > > > To: Costello, Roger L. > > > Cc: xml-dev@lists.xml.org > > > Subject: Re: [xml-dev] ANN: the first million prime numbers in XML > > format > > > > > > A small correction: > > > > > > I was speaking about all the primes less than 50 million, nor > about > > the first 50 million primes. > > > > > > Cheers, > > > > > > Dimitre. > > > > > > On Thu, Jul 5, 2012 at 4:49 PM, Dimitre > > Novatchev wrote: > > > > >> I have had for years even bigger collections of primes > and > have used > >> them to solve Project Eulet problems entirely > with XSLT. > > >> > > >> The first 50 million primes occupy 27MB. > > >> > > >> The format is more convenient for XSLT: > > >> > > >>

**Follow-Ups**:**RE: [xml-dev] ANN: the first million prime numbers in XML format***From:*"Rushforth, Peter" <Peter.Rushforth@NRCan-RNCan.gc.ca>

**RE: [xml-dev] ANN: the first million prime numbers in XML format***From:*"Len Bullard" <Len.Bullard@ses-i.com>

[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index]

News |
XML in Industry |
Calendar |
XML Registry

Marketplace | Resources | MyXML.org | Sponsors | Privacy Statement

Copyright 1993-2007 XML.org. This site is hosted by OASIS

Marketplace | Resources | MyXML.org | Sponsors | Privacy Statement

Copyright 1993-2007 XML.org. This site is hosted by OASIS