mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Blogorrhea > storflyt32

Reply
 
Thread Tools
Old 2016-06-16, 22:57   #210
storflyt32
 
Feb 2013

7128 Posts
Default

http://factordb.com/index.php?id=1100000000808153728

If you happen to be having the time, you could give this one a look.

In fact I was trying something else when I came across this one.
storflyt32 is offline   Reply With Quote
Old 2016-06-17, 02:40   #211
storflyt32
 
Feb 2013

2×229 Posts
Default

Only goes to show that at least I am trying.

Since it became late in the night, I could perhaps tell that I am not popular in the Wikipedia.

Apparently they do not want me posting there.

I was looking up the article about Archimedes and next chose to mention in the Talk page for the article that if he was running in a competition, he will never catch up with a walking turtle, because while he is still running, the turtle is also walking and so on.

Is there a possible analogy to this story?

Is this perhaps the reason why RSA-1024 may not be factorized?

Everyone knows that 7 * 7 = 49 and also that 5 * 7 = 35

It follows that gcd(35,49) = 7

But that is not the main point here.

Could it be shown or proven that some C200 or the like may be having a prime factor by means of a factorization which next divides from RSA-1024?

Or are you perhaps to assume that only two specific factors might be the correct factors and that they could be found by means of a random chance or selection?

Perhaps there is still no good answer to this question.

Last fiddled with by storflyt32 on 2016-06-17 at 02:41
storflyt32 is offline   Reply With Quote
Old 2016-06-17, 05:51   #212
storflyt32
 
Feb 2013

45810 Posts
Default

http://factordb.com/index.php?id=1100000000841056969

http://factordb.com/index.php?id=1100000000841056972

I happened to just multiply the P50 with the C67 being the product of the P29 and P38.

Perhaps I better should wait for the factorization, which maybe could be made quicker by either assuming or guessing that a pair of intermediate size factors could be in between and not only the larger factor itself.

Anyway, the P172 becomes yet another factor among others.

Last fiddled with by storflyt32 on 2016-06-17 at 05:52
storflyt32 is offline   Reply With Quote
Old 2016-06-17, 07:21   #213
storflyt32
 
Feb 2013

1110010102 Posts
Default

http://factordb.com/index.php?id=1100000000840930619

http://factordb.com/index.php?id=1100000000840930654

The first factorization apparently blew when trying out for real.

Giving a try on the second one instead.

Last fiddled with by storflyt32 on 2016-06-17 at 07:23
storflyt32 is offline   Reply With Quote
Old 2016-06-19, 01:07   #214
storflyt32
 
Feb 2013

2·229 Posts
Default

P21 = 463332824296470256087

Found a possible factor candidate number when it comes to divisibility of numbers.

Gives me a P263, P353 and also a PRP1103 when testing against some well-known composite numbers.

Getting back at it.

Last fiddled with by storflyt32 on 2016-06-19 at 01:28
storflyt32 is offline   Reply With Quote
Old 2016-06-19, 01:56   #215
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

224058 Posts
Default

Jeremiah 51:63 comes to mind when reading this thread.
Batalov is offline   Reply With Quote
Old 2016-06-19, 03:22   #216
storflyt32
 
Feb 2013

2·229 Posts
Default

I lost a P190 factor (between 190 and 200) yesterday because of my faultering arms.

Could possibly be found again.

Last fiddled with by storflyt32 on 2016-06-19 at 03:23
storflyt32 is offline   Reply With Quote
Old 2016-06-22, 10:33   #217
storflyt32
 
Feb 2013

2×229 Posts
Default

Same goes with a P263 which for now became lost.

http://factordb.com/index.php?id=1100000000841432205

http://factordb.com/index.php?id=1100000000841432049

Multiply the P116 with the P161 and next "divide" from RSA-2048 and factorize the number you get.

Here I get 2*2*2*13*19*227 * P10 = 1215040483 * P12 = 127602115867 * P20 * P295 as the answer.

http://factordb.com/index.php?id=1100000000841432869

http://factordb.com/index.php?id=1100000000841433296
storflyt32 is offline   Reply With Quote
Old 2016-06-23, 02:33   #218
jwaltos
 
jwaltos's Avatar
 
Apr 2012
Brady

27×3 Posts
Default

"Jeremiah 51:63 KJV: And it shall be, when thou hast made an end of reading this book, [that] thou shalt bind a stone to it, and cast it into the midst of Euphrates:"

(I learned something new and unexpected.)
jwaltos is offline   Reply With Quote
Old 2016-06-24, 00:49   #219
storflyt32
 
Feb 2013

1110010102 Posts
Default

The C1133 of 2^4096+1 again.

Sorry about the wrong sign.

But tonight getting a pair of P246 and PRP886 factors, with only 2^3 * 3^2 in between, apparently both ways.

Needs checking, but this is one of the three or so best I have.

Closing in on this problem right now and my guess is that that the answer may be found in the near future.

Edit: Also another PRP860 factor being added to my list right now as well.

Last fiddled with by storflyt32 on 2016-06-24 at 01:04
storflyt32 is offline   Reply With Quote
Old 2016-06-27, 11:25   #220
wreck
 
wreck's Avatar
 
"Bo Chen"
Oct 2005
Wuhan,China

16810 Posts
Default

Sorry at first.
But is it possible to add this post to personal ignore list?
wreck is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Can Pollard Rho cycles be used to find a factor? wwf Factoring 26 2013-09-30 04:24
PFGW can't find a small factor. Arkadiusz Software 7 2013-02-18 12:43
Chance to find an n-digit factor with ECM RedGolpe Factoring 4 2007-03-23 15:24
How much ECM does it take to find a given factor? geoff Factoring 5 2004-09-29 20:14
Where I find the best program to it factor keys? I use AMD. chrow Factoring 5 2004-02-19 10:15

All times are UTC. The time now is 19:53.


Fri Jul 16 19:53:37 UTC 2021 up 49 days, 17:40, 1 user, load averages: 2.21, 2.27, 2.46

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.