mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Factoring

Reply
Thread Tools
Old 2019-10-23, 19:46   #1618
jyb
 
jyb's Avatar
 
Aug 2005
Seattle, WA

2×883 Posts
Default

Quote:
Originally Posted by RichD View Post
Hint: 957 = 3 * 11 * 29
I'm afraid I don't find this enlightening. I can use algebraic factors to find a polynomial for this number in several different ways. However, I can find no way to get the difficulty down to 332 without having a degree of at least 20. Are you saying you have found such a way?
jyb is offline   Reply With Quote
Old 2019-10-23, 20:06   #1619
swellman
 
swellman's Avatar
 
Jun 2012

11·281 Posts
Default

Quote:
Originally Posted by jyb View Post
Good luck!

FWIW, it's probably not necessary to reserve a number for which you're just planning to run ECM. Unless there's a high likelihood of success, we don't need to worry too much about duplicating effort, since every extra ECM curve run by anyone else will still be helpful. However, if you really, really want to make sure that you're the only one looking at this number, then there's no real harm in making the reservation. Just know that the ECMnet server may still be handing it out.
No worries on ECMnet, I was just guarding against the unlikely scenario of someone else picking it out for individual ECM effort. Won’t make a habit of reserving HCNs for individual ECM efforts going forward.
swellman is online now   Reply With Quote
Old 2019-10-23, 20:23   #1620
R.D. Silverman
 
R.D. Silverman's Avatar
 
Nov 2003

22×5×373 Posts
Default

Quote:
Originally Posted by jyb View Post
Can you show me that split? More concretely, can you show me the actual polynomial you would use?
It's a mess. I have no computer algebra system to do the manipulations. It may well
be that the final polynomial has a Hamming weight that is too large to be useful.

The base 11 Aurifeuillians have a LOT of terms.
R.D. Silverman is offline   Reply With Quote
Old 2019-10-23, 21:06   #1621
jyb
 
jyb's Avatar
 
Aug 2005
Seattle, WA

2·883 Posts
Default

Quote:
Originally Posted by R.D. Silverman View Post
It's a mess. I have no computer algebra system to do the manipulations. It may well
be that the final polynomial has a Hamming weight that is too large to be useful.

The base 11 Aurifeuillians have a LOT of terms.
Yes, the relevant identity can be found here. Note that using this will automatically use both the algebraic factors given by the 3 and the 11, so it actually gets the difficulty down to 302.

But its natural degree is 20. We can halve that to get a 10th-degree polynomial, but I see no way to do better than that.
jyb is offline   Reply With Quote
Old 2019-10-23, 22:07   #1622
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

9,497 Posts
Default

Funny fact:
11^290+16*11^261*3^29+37*11^232*3^58+19*11^203*3^87-32*11^174*3^116-59*11^145*3^145-32*11^116*3^174+19*11^87*3^203+37*11^58*3^232+16*11^29*3^261+3^290+33^15*(11^261+5*11^232*3^29+6*11^203*3^58-11^174*3^87-9*11^145*3^116-9*11^116*3^145-11^87*3^174+6*11^58*3^203+5*11^29*3^232+3^261)
is shorter (281 symbols) to write than
c303 in http://factordb.com/index.php?id=1100000000803053534
so factordb replaced the description with the polynomial one.
Batalov is offline   Reply With Quote
Old 2019-10-24, 03:11   #1623
EdH
 
EdH's Avatar
 
"Ed Hall"
Dec 2009
Adirondack Mtns

28×3×5 Posts
Default

5+2,429 (SNFS):
Code:
174488927704196017427834562121968536581079996293421394919018919940726247
209043091779597774551774686317841540363734596172666574678086496372738995504504719585897383
EdH is offline   Reply With Quote
Old 2019-10-25, 14:22   #1624
EdH
 
EdH's Avatar
 
"Ed Hall"
Dec 2009
Adirondack Mtns

1111000000002 Posts
Default

11+10,291 (SNFS):
Code:
380266943142329489412928870550360580454015242272929288510561
91914698655355790011195552383112079792954658462237710112670585624673996698462259257559594644719083486385439
EdH is offline   Reply With Quote
Old 2019-10-26, 02:23   #1625
EdH
 
EdH's Avatar
 
"Ed Hall"
Dec 2009
Adirondack Mtns

28×3×5 Posts
Default

11+5,291 (SNFS):
Code:
47521634785763411240247359604230285991147693001772703203641404053619418742692777
471929208501024860711796292282895325629782080663188075720839533085043437379187774162028765127369101
EdH is offline   Reply With Quote
Old 2019-10-26, 07:10   #1626
pinhodecarlos
 
pinhodecarlos's Avatar
 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK

3·17·97 Posts
Default

Looking forward to seeing next stats update. Also is it possible to show like on the GCW page the contributions breakdown per user (with all combinations)? Thank you.
pinhodecarlos is offline   Reply With Quote
Old 2019-10-26, 15:31   #1627
EdH
 
EdH's Avatar
 
"Ed Hall"
Dec 2009
Adirondack Mtns

74008 Posts
Default

11+7,291 (SNFS):
Code:
13887041718955084964115299213884823850098058524524459846840021965702131949435080239
189866682981898495174146951771128840200039263317932342660926788811513955895890735130955393913903811863273027
EdH is offline   Reply With Quote
Old 2019-10-27, 02:14   #1628
EdH
 
EdH's Avatar
 
"Ed Hall"
Dec 2009
Adirondack Mtns

28·3·5 Posts
Default

11-5,291 (SNFS):
Code:
38570866425429718750632134005994098100226746641653615888603985991302290837706069934854812289201275837244293972913
1382692059052256387858158993319709629363715785078428304443505109860053154824264309912657
EdH is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
New phi for homogeneous Cunningham numbers wpolly Factoring 26 2016-07-29 04:34
Mathematics of Cunningham Numbers (3rd ed., 2002, A.M.S.) Xyzzy Cunningham Tables 42 2014-04-02 18:31
Don't know how to work on Cunningham numbers. jasong GMP-ECM 6 2006-06-30 08:51
Doing Cunningham numbers but messed up. jasong Factoring 1 2006-04-03 17:18
Need help factoring Cunningham numbers jasong Factoring 27 2006-03-21 02:47

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


Fri Aug 6 15:04:50 UTC 2021 up 14 days, 9:33, 1 user, load averages: 2.21, 2.66, 2.76

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.