![]() |
Now what?
Many thanks to everyone who helped out with sieving 6^383+1.
It will take about two weeks before I know whether the matrix that I've built has usable relations and find a factor from it. It may be that everyone wants to go back to sleep; this is a time of year in which I often consider the delights of hibernation. But it's always possible that people might want to do some sieving, so I have prepared some suggestions [except that I spent more than fifteen minutes carefully mulling over my suggestions, and at this point I wasn't allowed to add the poll] Poll options were 1. Curl into a ball under a rotting log and wait for the spring 2. See what an entrepreneurial character would do to remedy the paucity of llama-trekking outfits in Transylvania 3. 3^512+1 C245 by SNFS 4. 2^836+1 C162 by GNFS 5. 12^253+1 C169 by GNFS |
[QUOTE=fivemack;123358]Many thanks to everyone who helped out with sieving 6^383+1.
It will take about two weeks before I know whether the matrix that I've built has usable relations and find a factor from it. It may be that everyone wants to go back to sleep; this is a time of year in which I often consider the delights of hibernation. But it's always possible that people might want to do some sieving, so I have prepared some suggestions [except that I spent more than fifteen minutes carefully mulling over my suggestions, and at this point I wasn't allowed to add the poll] Poll options were 1. Curl into a ball under a rotting log and wait for the spring 2. See what an entrepreneurial character would do to remedy the paucity of llama-trekking outfits in Transylvania 3. 3^512+1 C245 by SNFS 4. 2^836+1 C162 by GNFS 5. 12^253+1 C169 by GNFS[/QUOTE] Note that 2,836+ may be easier by SNFS. It is only 760 bits via a quintic. |
| All times are UTC. The time now is 15:38. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.