20051108, 02:58  #1 
Nov 2005
266_{8} Posts 
Is there a large memory method?
Are there any ways to take advantage of large amounts of system memory to speed up the process? I know that irrational numbers like digits of Pi can be run rather quickly on PCs with large RAM and a GB of storage. Is there an algorithm like this for sets of rational numbers?
I understand that arbitary digits of a transcendental number are related to an infinite series like the primes which are of course unpredictable as well. Just because they're unpredictable doesn't make them truely random since we get the same results every time we run a sieve for primes or square root of 2! :) Last fiddled with by nibble4bits on 20051108 at 02:58 
20051108, 08:24  #2 
Aug 2002
Termonfeckin, IE
101011001100_{2} Posts 
Me opens a packet of popcorn and waits for Bob

20051108, 09:45  #3 
"Nancy"
Aug 2002
Alexandria
2,467 Posts 
Me lounges next to garo and starts eating his popcorn. This ought to be good...
Alex 
20051108, 10:40  #4 
Cranksta Rap Ayatollah
Jul 2003
641 Posts 
<opens a box of junior mints>

20051108, 11:24  #5 
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
3×5×743 Posts 
Shall I nip out for some beer and pizza? If so, what toppings would people like?
Paul 
20051108, 11:34  #6 
"Richard B. Woods"
Aug 2002
Wisconsin USA
17014_{8} Posts 
Jalapeรฑos, mushrooms, and extra cheese
Last fiddled with by cheesehead on 20051108 at 11:40 
20051108, 12:54  #7  
Nov 2003
2^{2}×5×373 Posts 
Quote:
Spend a little time proofreading your posts. Mathematics is a language in which we can say *exactly* what we mean. You have posted gibberish. "The" processs. Which process would that be??? "irrational numbers like digits of pi" The digits of pi are not irrational. pi itself is irrational. "run rather quickly" How does pi or digits of pi "run quickly"? "understand .... arbitrary digits of a transcendental number are related to an infinite series like the primes" Digits are not related to an infinite series. Digits are finite. And a transcendental number is not "related" to an infinite series, it IS an infinite series. Since when are primes "an infinite series"???? "because they're unpredictable doesn't make them truely [sic] random" You have no understanding of what it means to be random. Go read a book on the subject. The first half of Knuth Vol 2. would be a good start. "same results every time we run a sieve for primes or square root of 2" Do you know what it means for an algorithm to be deterministic? Clearly not. We do not 'run a sieve' for sqrt(2) You can't even write clear English. You are a troll. Go study. Study very hard. When you improve to the point where you are clueless, get back to us. I apologize to the general audience. But people who spew nonsense about a subject that they have not studied, and do not understand, are an irritant. 

20051108, 14:22  #8 
May 2003
3×7×11 Posts 
Not a fair match. He didn't stand a chance.

20051108, 16:44  #9 
"Phil"
Sep 2002
Tracktown, U.S.A.
3·373 Posts 

20051109, 10:05  #10 
Nov 2005
2×7×13 Posts 
Wow, someone's not got enough sleep. :P

20051109, 10:21  #11 
"Nancy"
Aug 2002
Alexandria
2,467 Posts 
Even though there was vigor in it, the flame seemed slightly forced. I give it an 8.0.
Alex 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
New method of finding large prime numbers  georgelouis@mac  Math  41  20110125 21:06 
Large memory usage  Unregistered  Information & Answers  8  20100514 23:45 
Largecapacity memory  fivemack  Hardware  17  20100212 22:29 
GMPECM on large memory systems ~ 60 Gb  Tom  GMPECM  20  20071221 18:57 
Large memory bugfix for mprime 24.14.2  S00113  Software  7  20060324 02:56 