mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Prime Sierpinski Project

Reply
 
Thread Tools
Old 2012-01-28, 20:26   #1
iconized
 
Apr 2010
Netherlands

17 Posts
Default A basic math question

I am looking into the math behind PSP-PRP and other prime number finding projects. It is obvious that a lot of test candidates already have been eliminated. It's easy enough to figure out that all numbers dividable by 3 or 5 can easily be eliminated. Then in the past this project also did some sieve and eliminated even more test candidates.

Beyond that, are there more smart tricks that for example can easily exclude other numbers? Sorry in advance if this has been documented somewhere already, but it is hard to find stuff here on Mersenneforum.

Last fiddled with by iconized on 2012-01-28 at 20:39
iconized is offline   Reply With Quote
Old 2012-01-28, 21:01   #2
petrw1
1976 Toyota Corona years forever!
 
petrw1's Avatar
 
"Wayne"
Nov 2006
Saskatchewan, Canada

463510 Posts
Default

Quote:
Originally Posted by iconized View Post
I am looking into the math behind PSP-PRP and other prime number finding projects. It is obvious that a lot of test candidates already have been eliminated. It's easy enough to figure out that all numbers dividable by 3 or 5 can easily be eliminated. Then in the past this project also did some sieve and eliminated even more test candidates.

Beyond that, are there more smart tricks that for example can easily exclude other numbers? Sorry in advance if this has been documented somewhere already, but it is hard to find stuff here on Mersenneforum.
Did you look here?
http://www.mersenne.org/various/math.php
petrw1 is online now   Reply With Quote
Old 2012-02-03, 00:01   #3
Mini-Geek
Account Deleted
 
Mini-Geek's Avatar
 
"Tim Sorbera"
Aug 2006
San Antonio, TX USA

17×251 Posts
Default

There are various algebraic factorizations (applicable to some bases/k's, anyway; I'm not sure if PSP in particular benefits from them) that can eliminate numbers that don't have any small factors. An example of something like that are Aurifeuillian factorizations. While Aurifeuillian factorizations aren't useful for prime searching (they are useful for factoring), that's just an example.
Mini-Geek is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Question regarding basic routines being used in Yafu. storflyt32 YAFU 2 2015-06-29 23:25
basic question for assignment wong8888 Information & Answers 5 2015-03-22 12:15
Very basic question about Wiedemann methods fivemack Math 0 2008-06-16 10:57
Basic optimisation question fivemack Puzzles 6 2008-04-08 13:50
Basic Question about ECM factoring? drake2 Math 1 2006-01-12 07:40

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

Wed May 12 04:08:11 UTC 2021 up 33 days, 22:49, 0 users, load averages: 1.66, 1.59, 1.61

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.