mersenneforum.org > Math Finding primes using modular stacking
 Register FAQ Search Today's Posts Mark Forums Read

 2007-12-06, 23:01 #1 goatboy   1B4616 Posts 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. Comments?
2007-12-07, 12:30   #2
m_f_h

Feb 2007

1B016 Posts

Quote:
 Originally Posted by goatboy While I'm fairly intelligent (...) But I feel that I have a good ear(eye, whatever) for important concepts, (...) Comments?
I have the same problems.

 Similar Threads Thread Thread Starter Forum Replies Last Post BenR Computer Science & Computational Number Theory 2 2016-03-27 00:37 c10ck3r Information & Answers 34 2012-08-29 16:47 Unregistered Information & Answers 9 2012-06-24 13:50 henryzz Lounge 35 2007-10-20 03:06 rogue Lounge 4 2005-07-12 12:31

All times are UTC. The time now is 07:43.

Mon Nov 29 07:43:47 UTC 2021 up 129 days, 2:12, 0 users, load averages: 0.98, 0.87, 0.80