mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2005-11-08, 02:58   #1
nibble4bits
 
nibble4bits's Avatar
 
Nov 2005

2668 Posts
Question 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 2005-11-08 at 02:58
nibble4bits is offline   Reply With Quote
Old 2005-11-08, 08:24   #2
garo
 
garo's Avatar
 
Aug 2002
Termonfeckin, IE

1010110011002 Posts
Default

Me opens a packet of popcorn and waits for Bob
garo is offline   Reply With Quote
Old 2005-11-08, 09:45   #3
akruppa
 
akruppa's Avatar
 
"Nancy"
Aug 2002
Alexandria

2,467 Posts
Default

Me lounges next to garo and starts eating his popcorn. This ought to be good...

Alex
akruppa is offline   Reply With Quote
Old 2005-11-08, 10:40   #4
Orgasmic Troll
Cranksta Rap Ayatollah
 
Orgasmic Troll's Avatar
 
Jul 2003

641 Posts
Default

<opens a box of junior mints>
Orgasmic Troll is offline   Reply With Quote
Old 2005-11-08, 11:24   #5
xilman
Bamboozled!
 
xilman's Avatar
 
"๐’‰บ๐’ŒŒ๐’‡ท๐’†ท๐’€ญ"
May 2003
Down not across

3×5×743 Posts
Default

Shall I nip out for some beer and pizza? If so, what toppings would people like?


Paul
xilman is offline   Reply With Quote
Old 2005-11-08, 11:34   #6
cheesehead
 
cheesehead's Avatar
 
"Richard B. Woods"
Aug 2002
Wisconsin USA

170148 Posts
Default

Jalapeรฑos, mushrooms, and extra cheese

Last fiddled with by cheesehead on 2005-11-08 at 11:40
cheesehead is offline   Reply With Quote
Old 2005-11-08, 12:54   #7
R.D. Silverman
 
R.D. Silverman's Avatar
 
Nov 2003

22×5×373 Posts
Default

Quote:
Originally Posted by nibble4bits
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! :)
Do yourself a favor. Study a little bit of math before you post again.
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.
R.D. Silverman is offline   Reply With Quote
Old 2005-11-08, 14:22   #8
fatphil
 
fatphil's Avatar
 
May 2003

3×7×11 Posts
Default

Not a fair match. He didn't stand a chance.
fatphil is offline   Reply With Quote
Old 2005-11-08, 16:44   #9
philmoore
 
philmoore's Avatar
 
"Phil"
Sep 2002
Tracktown, U.S.A.

3·373 Posts
Default

philmoore is offline   Reply With Quote
Old 2005-11-09, 10:05   #10
nibble4bits
 
nibble4bits's Avatar
 
Nov 2005

2×7×13 Posts
Default

Wow, someone's not got enough sleep. :P
nibble4bits is offline   Reply With Quote
Old 2005-11-09, 10:21   #11
akruppa
 
akruppa's Avatar
 
"Nancy"
Aug 2002
Alexandria

2,467 Posts
Default

Even though there was vigor in it, the flame seemed slightly forced. I give it an 8.0.

Alex
akruppa is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
New method of finding large prime numbers georgelouis@mac Math 41 2011-01-25 21:06
Large memory usage Unregistered Information & Answers 8 2010-05-14 23:45
Large-capacity memory fivemack Hardware 17 2010-02-12 22:29
GMP-ECM on large memory systems ~ 60 Gb Tom GMP-ECM 20 2007-12-21 18:57
Large memory bugfix for mprime 24.14.2 S00113 Software 7 2006-03-24 02:56

All times are UTC. The time now is 04:34.


Tue Jan 25 04:34:54 UTC 2022 up 185 days, 23:03, 0 users, load averages: 1.52, 1.49, 1.42

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

โ‰  ยฑ โˆ“ รท ร— ยท โˆ’ โˆš โ€ฐ โŠ— โŠ• โŠ– โŠ˜ โŠ™ โ‰ค โ‰ฅ โ‰ฆ โ‰ง โ‰จ โ‰ฉ โ‰บ โ‰ป โ‰ผ โ‰ฝ โŠ โŠ โŠ‘ โŠ’ ยฒ ยณ ยฐ
โˆ  โˆŸ ยฐ โ‰… ~ โ€– โŸ‚ โซ›
โ‰ก โ‰œ โ‰ˆ โˆ โˆž โ‰ช โ‰ซ โŒŠโŒ‹ โŒˆโŒ‰ โˆ˜ โˆ โˆ โˆ‘ โˆง โˆจ โˆฉ โˆช โจ€ โŠ• โŠ— ๐–• ๐–– ๐–— โŠฒ โŠณ
โˆ… โˆ– โˆ โ†ฆ โ†ฃ โˆฉ โˆช โŠ† โŠ‚ โŠ„ โŠŠ โŠ‡ โŠƒ โŠ… โŠ‹ โŠ– โˆˆ โˆ‰ โˆ‹ โˆŒ โ„• โ„ค โ„š โ„ โ„‚ โ„ต โ„ถ โ„ท โ„ธ ๐“Ÿ
ยฌ โˆจ โˆง โŠ• โ†’ โ† โ‡’ โ‡ โ‡” โˆ€ โˆƒ โˆ„ โˆด โˆต โŠค โŠฅ โŠข โŠจ โซค โŠฃ โ€ฆ โ‹ฏ โ‹ฎ โ‹ฐ โ‹ฑ
โˆซ โˆฌ โˆญ โˆฎ โˆฏ โˆฐ โˆ‡ โˆ† ฮด โˆ‚ โ„ฑ โ„’ โ„“
๐›ข๐›ผ ๐›ฃ๐›ฝ ๐›ค๐›พ ๐›ฅ๐›ฟ ๐›ฆ๐œ€๐œ– ๐›ง๐œ ๐›จ๐œ‚ ๐›ฉ๐œƒ๐œ— ๐›ช๐œ„ ๐›ซ๐œ… ๐›ฌ๐œ† ๐›ญ๐œ‡ ๐›ฎ๐œˆ ๐›ฏ๐œ‰ ๐›ฐ๐œŠ ๐›ฑ๐œ‹ ๐›ฒ๐œŒ ๐›ด๐œŽ ๐›ต๐œ ๐›ถ๐œ ๐›ท๐œ™๐œ‘ ๐›ธ๐œ’ ๐›น๐œ“ ๐›บ๐œ”