mersenneforum.org > Math Catalan sequence (is C5 prime?)
 Register FAQ Search Today's Posts Mark Forums Read

 2003-09-05, 05:53 #1 Orgasmic Troll Cranksta Rap Ayatollah     Jul 2003 641 Posts Catalan sequence (is C5 prime?) is anybody putting any work in on this? ran across it on the Prime Pages sure, the exponent is 170141183460469231731687303715884105727, but it seems like if anybody was going to bang away at it, it would be someone in here.[/url]
 2003-09-05, 15:29 #2 jocelynl   Sep 2002 10616 Posts Hi Travist, Look further on the prime page you'll see the link to http://www.ltkz.demon.co.uk/ar2/mm61.htm Tony Forbes search for factors Joss[/url]
 2003-09-05, 15:42 #3 nomadicus     Jan 2003 North Carolina 2×3×41 Posts This is M170141183460469231731687303715884105727. *If* prime95 could handle a number that large (C5 is much, much larger then prime95's maximum (somewhere around M77000000)), I suspect with current technology it would take a century or two to compute (or is that a millenium or two?); that is, of course, if the current technology could even begin to handle a number this large.
 2003-09-05, 16:15 #4 Orgasmic Troll Cranksta Rap Ayatollah     Jul 2003 641 Posts just for clarification, I didn't expect anyone to be trying to prove primality, just looking for factors. Thanks for the link, jocylenl
 2003-10-01, 15:06 #5 Citrix     Jun 2003 3×232 Posts M? What number will be MM127 expected to be for example the MP 40 is currently being searched. Citrix
2003-10-02, 17:32   #6

"Richard B. Woods"
Aug 2002
Wisconsin USA

22·3·641 Posts

Quote:
 Originally posted by nomadicus This is M170141183460469231731687303715884105727. *If* prime95 could handle a number that large (C5 is much, much larger then prime95's maximum (somewhere around M77000000)), I suspect with current technology it would take a century or two to compute (or is that a millenium or two?);
Oh, much, much, much, much longer than a millenium!

The exponent is more than 2*10^30 times Prime95's current maximum exponent (79,300,000).

2*10^30 > 2^100.

Doubling the exponent multiplies the execution time by more than a factor of 2, so multiplying the exponent by 2^100 raises the time by more than 2^100. We're talking about longer than nonillions (1 nonillion = 1 trillion * 1 billion * 1 billion) of years.

Quote:
 that is, of course, if the current technology could even begin to handle a number this large.
Order of 10^38 bits or so.

Giga- = 10^9
Tera- = 10^12
Peta- = 10^15
Exa- = 10^18
Zetta- = 10^21
Yotta- = 10^24

Need those petayottabyte memory sticks.

Last fiddled with by cheesehead on 2003-10-02 at 17:35

 2003-10-02, 17:50 #7 cheesehead     "Richard B. Woods" Aug 2002 Wisconsin USA 22×3×641 Posts (Curses on the %& 5-minute editing deadline! Yeah, I know it's for the greater good.) My nonillion-year estimate was based on just the ratio of times for single L-L iterations. There's an additional factor of 2*10^30 on the number of iterations required. So it's 2*10^30 nonillion years. But ... if there's a "Moore's Law"yerish doubling of speeds every 18 months ... Oh, someone _else_ figure that one!
 2003-10-02, 20:42 #8 Maybeso     Aug 2002 Portland, OR USA 27410 Posts Well, my lunch napkin is too small for working that one out. But we can say that Moore's "Law" implies it is a waste of time to start now, since using next years machine will save more than a year of time ... That argument does make sense in this case, because passing this problem from today's machine to next years would be fairly difficult. Switching machines in the middle of an LL this big is impossible, for factoring it would be merely "challenging".
 2003-10-02, 21:18 #9 ixfd64 Bemusing Prompter     "Danny" Dec 2002 California 25·7·11 Posts And by several decades, we'll probably have quantum computers that can factor MM127 in less than a second...
 2003-10-03, 13:41 #10 Orgasmic Troll Cranksta Rap Ayatollah     Jul 2003 641 Posts My knowledge of quantum computers is pretty small, but does the computation time increase for factoring larger numbers?
2003-10-03, 15:45   #11
xilman
Bamboozled!

"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across

22·3·941 Posts

Quote:
 Originally posted by TravisT My knowledge of quantum computers is pretty small, but does the computation time increase for factoring larger numbers?
My knowledge is far from encyclopaedic, but I do know the time on a QC grows polynomially with the number of bits in the number to be factored. The best algorithms we know for factoring on conventional computers are superpolynomial, though subexponential.

I think it is likely to be a long time before we can factor general integers the size of C5. As far as I am aware, the record still stands at 15 for a factorization by a QC.

Paul

 Similar Threads Thread Thread Starter Forum Replies Last Post garambois Aliquot Sequences 12 2015-10-21 10:24 Stan Miscellaneous Math 34 2013-08-25 17:35 davar55 Puzzles 16 2009-07-02 19:58 roger Puzzles 25 2007-02-09 15:50 mfgoode Math 58 2005-07-04 21:48

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

Tue May 17 04:45:20 UTC 2022 up 33 days, 2:46, 0 users, load averages: 2.10, 2.15, 1.81

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.

โ  ยฑ โ รท ร ยท โ โ โฐ โ โ โ โ โ โค โฅ โฆ โง โจ โฉ โบ โป โผ โฝ โ โ โ โ ยฒ ยณ ยฐ
โ  โ ยฐ โ ~ โ โ โซ
โก โ โ โ โ โช โซ โโ โโ โ โ โ โ โง โจ โฉ โช โจ โ โ ๐ ๐ ๐ โฒ โณ
โ โ โ โฆ โฃ โฉ โช โ โ โ โ โ โ โ โ โ โ โ โ โ โ โค โ โ โ โต โถ โท โธ ๐
ยฌ โจ โง โ โ โ โ โ โ โ โ โ โด โต โค โฅ โข โจ โซค โฃ โฆ โฏ โฎ โฐ โฑ
โซ โฌ โญ โฎ โฏ โฐ โ โ ฮด โ โฑ โ โ
๐ข๐ผ ๐ฃ๐ฝ ๐ค๐พ ๐ฅ๐ฟ ๐ฆ๐๐ ๐ง๐ ๐จ๐ ๐ฉ๐๐ ๐ช๐ ๐ซ๐ ๐ฌ๐ ๐ญ๐ ๐ฎ๐ ๐ฏ๐ ๐ฐ๐ ๐ฑ๐ ๐ฒ๐ ๐ด๐๐ ๐ต๐ ๐ถ๐ ๐ท๐๐ ๐ธ๐ ๐น๐ ๐บ๐