Go Back > Great Internet Mersenne Prime Search > Hardware > GPU Computing

Thread Tools
Old 2012-04-03, 09:26   #1
jasong's Avatar
"Jason Goatcher"
Mar 2005

3×7×167 Posts
Default What about general purpose sieving of k*b^n+/-1?

Obviously, sieving for Mersenne numbers works great, but what about the more general equation? Is anyone working on that? Is it even worth it for a programmer to bother?
jasong is offline   Reply With Quote
Old 2012-04-03, 10:52   #2
Just call me Henry
henryzz's Avatar
Sep 2007
Cambridge (GMT/BST)

24·7·53 Posts

Look in the prime search projects section of the forum. Lots of them search this form.
henryzz is online now   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Purpose Built rig? pool party GPU Computing 37 2017-06-01 04:16
General factoring algorithms not using sieving mickfrancis Factoring 21 2016-02-22 19:38
S9 and general sieving discussion Lennart Conjectures 'R Us 31 2014-09-14 15:14
Simplest general purpose CPU? nibble4bits Puzzles 8 2008-06-05 11:32
Purpose of p-1 factoring drew Marin's Mersenne-aries 2 2005-06-29 15:00

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

Sat Nov 27 23:30:35 UTC 2021 up 127 days, 17:59, 0 users, load averages: 1.34, 1.26, 1.18

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.