Go Back > Great Internet Mersenne Prime Search > Math

Thread Tools
Old 2007-12-06, 23:01   #1

100010011100012 Posts
Default Finding primes using modular stacking

While I'm fairly intelligent, I don't know a lot of math and only the barest minimum of modular arithmetic, the 'mod 12' clock example is about as far as I've gotten, lol.

But I feel that I have a good ear(eye, whatever) for important concepts, so I have a question:

With the Riesel and Sierpinski problems, the special ks for those numbers basically arise from a convenient 'stacking' of their arithmetic properties when it comes to the equation k*2^n+c, the Riesel for c=-1 and the Sierpinski for c=+1. I was wondering if anyone had considered going 'the other way,' in a sense. I'm not really sure if one would want to find areas(n-values for specific ks and k-values for specific ns) with few low factors, or a lot of low factors, or even what a good definition of 'low' is in this context. I just thought I'd throw that out there for both the amateurs and the experts to chew over.

  Reply With Quote
Old 2007-12-07, 12:30   #2
m_f_h's Avatar
Feb 2007

24·33 Posts

Originally Posted by goatboy View Post
While I'm fairly intelligent (...)
But I feel that I have a good ear(eye, whatever) for important concepts, (...)
I have the same problems.
m_f_h is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Fast modular reduction for primes < 512 bits? BenR Computer Science & Computational Number Theory 2 2016-03-27 00:37
Finding VERY large primes c10ck3r Information & Answers 34 2012-08-29 16:47
Best Work for Finding Primes Unregistered Information & Answers 9 2012-06-24 13:50
Finding primes from 1 upwards henryzz Lounge 35 2007-10-20 03:06
Finding primes with a PowerPC rogue Lounge 4 2005-07-12 12:31

All times are UTC. The time now is 18:06.

Wed Oct 28 18:06:27 UTC 2020 up 48 days, 15:17, 2 users, load averages: 2.45, 2.48, 2.32

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.