mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Factoring

Reply
 
Thread Tools
Old 2006-07-06, 08:19   #1
xilman
Bamboozled!
 
xilman's Avatar
 
"π’‰Ίπ’ŒŒπ’‡·π’†·π’€­"
May 2003
Down not across

10,939 Posts
Default Product launch

You may find this product amusing:

196175124573517092034922493422470908957491913295260473203518969764669282857
*
509748624946200879944668835201017220741864841301635474800405920115982269129


Paul
xilman is offline   Reply With Quote
Old 2006-07-06, 10:26   #2
Greenbank
 
Greenbank's Avatar
 
Jul 2005

2×193 Posts
Default

Why?
Greenbank is offline   Reply With Quote
Old 2006-07-06, 10:30   #3
JHansen
 
JHansen's Avatar
 
Apr 2004
Copenhagen, Denmark

11101002 Posts
Default

=10^149+21553 It's rare to find a number this well suited for SNFS with only two large prime factors.

JHansen is offline   Reply With Quote
Old 2006-07-06, 11:32   #4
Greenbank
 
Greenbank's Avatar
 
Jul 2005

2·193 Posts
Default

I'd thought that the Brilliant Number search had gone beyond this range but I was mistaken. The highest they have is 10^115+12741.

http://www.alpertron.com.ar/BRILLIANT.HTM

Last fiddled with by Greenbank on 2006-07-06 at 11:33
Greenbank is offline   Reply With Quote
Old 2006-07-07, 10:59   #5
smh
 
smh's Avatar
 
"Sander"
Oct 2002
52.345322,5.52471

118910 Posts
Default

This makes a nice candidate for a record brilliant number.

After prp testing, traildivision and a bit of ECM, i have just over 200 numbers left. More ECM will remove quite a few of these, but still a lot of SNFS remains.

I haven't checked how long a single number takes with SNFS though.
smh is offline   Reply With Quote
Old 2006-07-07, 14:27   #6
xilman
Bamboozled!
 
xilman's Avatar
 
"π’‰Ίπ’ŒŒπ’‡·π’†·π’€­"
May 2003
Down not across

10,939 Posts
Default

Quote:
Originally Posted by smh
This makes a nice candidate for a record brilliant number.

After prp testing, traildivision and a bit of ECM, i have just over 200 numbers left. More ECM will remove quite a few of these, but still a lot of SNFS remains.

I haven't checked how long a single number takes with SNFS though.
The attached file gives the smallest prime factor of all odd 150-digit numbers less than 10^149 + 21711.

You will see that it proves that 10^149+21553 is indeed the smallest 150-digit brilliant number.


Paul
Attached Files
File Type: gz brill.txt.gz (101.2 KB, 138 views)
xilman is offline   Reply With Quote
Old 2006-07-07, 17:24   #7
alpertron
 
alpertron's Avatar
 
Aug 2002
Buenos Aires, Argentina

22×3×5×23 Posts
Default

Excellent!!!

I will upload the data tonight.

How long has this task ran? Would it be easy to fill the holes in the table?
alpertron is offline   Reply With Quote
Old 2006-07-07, 21:15   #8
xilman
Bamboozled!
 
xilman's Avatar
 
"π’‰Ίπ’ŒŒπ’‡·π’†·π’€­"
May 2003
Down not across

252738 Posts
Default

Quote:
Originally Posted by alpertron
Excellent!!!

I will upload the data tonight.

How long has this task ran? Would it be easy to fill the holes in the table?
I forget off-hand when I started, but it was several years ago. I'll see whether I can dig out better information.

It took so long mostly because the SNFS sieving was performed almost entirely on some of my museum pieces. At most three machines were working at once --- a PPro 233, a PII-300 and a Sun Ultra10. Quite often only one or two of them were sieving. The filtering, linear algebra and square root phases were run on a 1.33GHz Athlon. Each SNFS took about two weeks and I had to run dozens of them. You'll note that 21553/2 factorizations had to be completed. OK, many of them were done by trial division but a substantial ECM effort was needed too.

The SNFS factorizations are easy to spot in the file I attached. They are the ones with (pxx) appended. The ECM factorizations are, essentially, those without a (pxx) and for which the factors are larger than 6 or 7 digits.

I suspect that it will take a long time, possibly several years, to fill the gaps in the table, unless a number of people make a concerted effort. When I started the record stood at around 100 digits, possibly a bit more. You can see for yourself how much progress has been made in that time and how much more is required to fill the gaps.


Paul
xilman is offline   Reply With Quote
Old 2006-07-08, 07:57   #9
smh
 
smh's Avatar
 
"Sander"
Oct 2002
52.345322,5.52471

29×41 Posts
Default

I count 77 SNFS tests.

For my 112 digits i did 210 SNFS tests, for 113 digits 351 and for 116 digits 53

Of course all of them were a lot easier.


Do you know what is the chance the brilliant shows up within lets say the first 25K n for numbers this size?

You might have been unlucky and have to run upto several hunderd K n

Last fiddled with by smh on 2006-07-08 at 07:57
smh is offline   Reply With Quote
Old 2006-07-09, 22:12   #10
Jens K Andersen
 
Jens K Andersen's Avatar
 
Feb 2006
Denmark

3468 Posts
Default

Congratulations on a great brilliant number.
Quote:
Originally Posted by xilman
The attached file gives the smallest prime factor of all odd 150-digit numbers less than 10^149 + 21711.
I guess Paul's brill.txt lists the first factor which was found.
ECM will often not find the smallest factor first.
My sieve to 400G found a smaller factor in 49 attached numbers below the brilliant 10^149+21553.
The largest difference was for 10^149+18537 with smallest factor 1616453 and Paul's 562916230505561.
Attached Files
File Type: txt brillsmall.txt (2.2 KB, 170 views)
Jens K Andersen is offline   Reply With Quote
Old 2006-07-10, 15:54   #11
xilman
Bamboozled!
 
xilman's Avatar
 
"π’‰Ίπ’ŒŒπ’‡·π’†·π’€­"
May 2003
Down not across

10,939 Posts
Default

Quote:
Originally Posted by Jens K Andersen
I guess Paul's brill.txt lists the first factor which was found.
ECM will often not find the smallest factor first.
My sieve to 400G found a smaller factor in 49 attached numbers below the brilliant 10^149+21553.
The largest difference was for 10^149+18537 with smallest factor 1616453 and Paul's 562916230505561.
Yes, you are quite right.

Nonetheless, the brill.txt file lists a prime factor of each number in the range necessary to establish that 10^149+21553 is the smallest 150-digit brilliant number.

Paul
xilman is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
ERROR: cudaGetLastError() returned 4: unspecified launch failure MacFactor GPU Computing 0 2017-12-22 16:04
(windows) How to launch mfaktO/C with processor affinity swl551 Software 1 2012-09-24 23:29
Launch of the AMD FX 8 Core processor moebius Hardware 80 2012-09-14 15:51
Prime fatal error on 3D launch kaeptn_kork Hardware 11 2009-03-17 01:58
Accelerated launch date for Intel 45nm quads rx7350 Hardware 1 2007-08-02 14:47

All times are UTC. The time now is 06:30.


Sat Oct 16 06:30:18 UTC 2021 up 85 days, 59 mins, 0 users, load averages: 1.02, 1.43, 1.27

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.