... Subject: Re: bimodal ditribution form counting signs of Pi digits differences Date: Mon, 01 Nov 2004 08:26:03 -0800 From: Roger Bagula <tftn@...>...
Note that Rule 30R does exactly the same behavior when the cell was 0 or white two steps back, whereas state of new cell is flipped when the cell itself was 1...
Roger L. Bagula
rlbtftn@...
Nov 1, 2004 4:38 pm
3013
... Subject: two questions on the Mandelbrot set Date: Sun, 31 Oct 2004 21:47:10 -0500 From: David Bernier <david250@...> Reply-To: ezcos@... ...
... Dear Dominic, It is election day, remember to vote! On the Pi/2 and complex plane quadratics ( Mandelbrot set , etc) I think you may be looking for the...
My answer is a qualified no: http://www.pnl.gov/energyscience/10-01/art3.htm http://pi.nersc.gov/ http://news.bbc.co.uk/1/hi/sci/tech/2146295.stm Respectfully,...
... Subject: normal digits base 10 ( used to be: bimodal ditribution form counting signs of Pi digits differences) Date: Wed, 03 Nov 2004 10:04:10 -0800 From:...
In all cases of phenomenus when there are hundred of forces in the event and therefore is impossible localizing a exactly solution due to enormous quantity of...
... http://moneyscience.org/tiki/tiki-read_article.php?articleId=12 ... __________________________________ Do you Yahoo!? Check out the new Yahoo! Front Page. ...
harunyıldırım
H_yildirim23@...
Nov 5, 2004 2:37 pm
3031
Dear gravitrino00, Statistical Mechanics is a field that was developed to deal with just this sort of problems in gases, fluids and solids. Erotic theory...
Anonymous contributions, you have no idea where any of this came from: 1: An interesting paper on those who dispute Cantor's proof, "An Editor Recalls Some...
This series works as a sum because the Prime gaps are in general a factor of two: Prime[n]=Prime[n-1]+Gap[n] Gap[n]=2*w[n] Product[1/Gap[n],{n,1,Infinity]=0 as...
Some time in the past a Louville number was made based on the modulo ten of the Primes past 5 which have a digit set of (1,3,7 ,9) and a magic square ...
I found a typo in this so that the function is actual one on the (1,3,7,9) digits instead of the gap. -->Mod[Prime[n-1],1] instead of Mod[Prime[n-1],10] I have...
Yes, that is so , just like the Binet function gives powers of a Sqrt[5] function that are always integers as well. It is the limited digit set and the powers ...
Dear Joyce of Pendle, The three identities you need are: Regular square: (x+I*y)^2=x^2-y^2+I*2*x*y Conjugate square: (x-I*y)^2=x^2-y^2-I*2*x*y Their product: ...