![]() |
![]() |
#188 |
Feb 2013
7608 Posts |
![]()
I lost all my factoring tasks for a restart, so here needs a redo, but also that my mother has passed away.
She was great, and having stamina, so she will be deeply missed. |
![]() |
![]() |
![]() |
#189 |
Feb 2013
24·31 Posts |
![]()
I got picked from my home again and sitting at a welfare center.
http://factordb.com/index.php?id=1100000004176425335 http://factordb.com/index.php?id=1100000004186737496 If someone could multiply the large ones here and next flip around for the Magic number, a little more progress should be available. |
![]() |
![]() |
![]() |
#190 |
Feb 2013
24×31 Posts |
![]()
I already edited the last one, but was asked to login again.
Blame the mobile phone just here. |
![]() |
![]() |
![]() |
#191 |
Feb 2013
24×31 Posts |
![]()
http://factordb.com/index.php?id=1100000004191589179
It gives me a new edit Window after posting, so here not knowing my position in the buffer for also page. I need the fliparound link here when still away from home and no access to Yafu. The intention here was flipping around for the Magic number or RSA-1024 so the factorization perhaps not needed for only the other number. Just a guess, but perhaps easier the other way, but also small factors here at first. Last fiddled with by storflyt32 on 2023-01-20 at 10:19 |
![]() |
![]() |
![]() |
#192 |
Feb 2013
24·31 Posts |
![]()
Jumps back for clicking wrong and losing contents or buffer once again.
I should be allowed to tick "Remember me" before logging in with my username. Should suffice for now that I do not see the fliparound, for not having access to Yafu. |
![]() |
![]() |
![]() |
#193 |
Feb 2013
24·31 Posts |
![]()
Should I edit or post a new one for still only a mobile phone?
You will have to fix that if needed, but suddenly I made it only LLR2 for 2^n-1. https://oeis.org/A000668 Anyone tried this, for just not knowing the results here? Here I compared any similar for only Genefer, but only sieving (or factors) for such a thing. At first it became only difficult for looking for not any LLR2, but here unable to try out for being away from home. Last fiddled with by storflyt32 on 2023-02-02 at 22:44 |
![]() |
![]() |
![]() |
#194 |
Feb 2013
24·31 Posts |
![]()
Becomes a new one here?
Only that I was looking for the corresponding list for 2^n+1 when still only factors or primes. I could try fill in the buffer for that of posts. http://factordb.com/index.php?id=1100000000633991051 http://factordb.com/index.php?id=1100000004316681914 What does this become for that of Yafuwise for not even knowing the C83? The remainder, for that of a C64 should be more easy to factorize. If someone could post a link to the flipovers (remaining factorizations), I would be thankful. Noone is doing this apparently, but delicious for factors here. Here the second last factor or P36 for a number starting with 6595, and I could be linking that. The other a P48, which took a huge or enormous time to factorize (750,000 seconds). Last fiddled with by storflyt32 on 2023-02-04 at 21:04 |
![]() |
![]() |
![]() |
#195 | |
Mar 2019
2·3·5·11 Posts |
![]() Quote:
Thank you for your comment. Last fiddled with by storflyt32 on 2023-02-03 at 21:19 |
|
![]() |
![]() |
![]() |
#196 |
Feb 2013
24×31 Posts |
![]()
Better make a new one for only short, when still only a mobile.
P13 = 1784031251021 This one for only small should be still on the heavier part of the tree. Try with (10^n) for that of n = 10^n, and next divide with Yafu and see what you get. Example: (10^100)/1784031251021, or (10^1000)/1784031251021. Last fiddled with by storflyt32 on 2023-02-04 at 22:57 |
![]() |
![]() |
![]() |
#197 |
Feb 2013
24×31 Posts |
![]()
I ended up at a public welfare center only using a tablet because my flat of living going bad.
Also a problem with my teeth, giving me quite much of pain, which I have to live with. Therefore, before doing anything else, one single request being asked for. I discovered or found a PRP or probable prime while still at home, and reported it to the Factor Database. But next becoming lost, and I do not know where it is residing, or the number. Here it was some 12300 - 12500 digits in size, and if anyone happen to know, I would gladly know. Thanks in advance! Last fiddled with by storflyt32 on 2023-03-17 at 21:22 |
![]() |
![]() |
![]() |
#198 |
Feb 2013
24×31 Posts |
![]()
http://www.loyalty.org/~schoen/rsa/
http://factordb.com/index.php?id=1100000004406374460 My bad, I should have added the first link earlier on. Also that this one also became a prior link being visited first, but that was yesterday and my log does not offer me any date and time stamp. So what do I get when "dividing" this number from RSA-1024? Should tell that factors here are already known for quite even in size. Here I ended up away from home only using a tablet, but that my curiosity has never vanished. Also keying this for the second time when the buffer cleared and contents vanished. I thought that square root of a composite number only could resolve for a little more, but not always so. https://www.alpertron.com.ar/ECM.HTM http://factordb.com/index.php?id=1100000004405115399 Someone added a little more for small factors, but here the C126 not being further factored. Need checking if I already added the link for this, because here only current post visible. A little more, because it got evening here for that of sitting down. Not so much for the first link at the top for only the difficult it could be, but rather the remainder of the number when you could be dividing. Here not having access at Yafu for only using a tablet, but if someone could offer me a link for that of such, I could give a try using the Alpertron factorization software (ecm). That was what I tried, namely the square root of the number starting with 1496, but only small factors first. Not sure if it is still running, but it says Curve 371 for being in the middle of it. Really that a 126 digit number is a bit too large for just a tablet and could take a long time. The impressive thing or feat is that someone knew in order to make it a composite number not any broken, except asymmetrical factors for not any similar. https://en.m.wikipedia.org/wiki/RSA_numbers https://en.m.wikipedia.org/wiki/RSA_numbers#RSA-1024 If I could add to the C102 someone could be angry with me, except still the factorization for the rest, where you could be "dividing" using Yafu, becoming what I could be asking for. http://factordb.com/index.php?id=1100000004405115399 Another interesting thing is knowing what it becomes when flipping around from still the same RSA-1024, because it could be just anything only because of the size of the number. But here unable to do that, except that it should be still CF, for only small factors at first. Last fiddled with by storflyt32 on 2023-03-18 at 22:03 |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
A Previous Miss? | R.D. Silverman | GMP-ECM | 4 | 2009-11-14 19:57 |
Using long long's in Mingw with 32-bit Windows XP | grandpascorpion | Programming | 7 | 2009-10-04 12:13 |
I think it's gonna be a long, long time | panic | Hardware | 9 | 2009-09-11 05:11 |
UPDATED: The current pre-sieved range reservation thread and stats page | gribozavr | Twin Prime Search | 10 | 2007-01-19 21:06 |
Ram allocation (in Re: previous thread) | JuanTutors | Marin's Mersenne-aries | 1 | 2004-08-29 17:23 |