20060613, 19:05  #1  
Sep 2005
2·3^{2} Posts 
sghodeif's Questions
why u take this form only? there is many forms can be used to find primes.
Quote:
Last fiddled with by sghodeif on 20060613 at 19:10 

20060613, 21:19  #2 
Nov 2003
2×1,811 Posts 
I'm not sure why you quoted this part, but we are searching for primes of form k*2^n1, k>1 with further restrictions as noted in post #1 because we are a project (click on "All Projects) of the Largest Known Primes, also known as Top5000 and each project is searching for a particular form. And if you want to find large primes and/or many of them you have to concentrate on something specific.

20060614, 04:25  #3 
"Curtis"
Feb 2005
Riverside, CA
4491_{10} Posts 
This seems like asking a Miata forum "why do you only talk about Mazdas? There are many kinds of cars." Mersenneforum.org has forums to exchange information and search spaces on many differeny forms of primes, and many other sites out there coordinate searches of other forms. This particular forum coordinates a narrow search type, to best organize the information without too much clutter.
We're perfectly aware of other forms for prime searches, and in fact many of us have participated in other projects (or still do). This subforum is for this specific form. Personally, I happen to believe the 15k style of search is very efficient at prime of given size per CPU cycle, so I concentrate my searches here. I don't try to talk others into moving to 15k, but I'm happy here. A fixedpower search is a little faster, at least in sieving phase, but I don't like the idea of searching for an exact size of prime; I can't settle on what size makes the most sense. Besides, there is no coordination for such a search, and it overlaps 15k, so I stay here. Curtis 
20060614, 08:30  #4  
May 2003
3·7·11 Posts 
Quote:
Then again, I'm the kind of guy who would post to a 'ruffian' forum. 

20060614, 18:19  #5  
Sep 2005
2×3^{2} Posts 
what i do with this
Quote:
Last fiddled with by sghodeif on 20060614 at 18:41 

20060614, 18:35  #6  
Sep 2005
2·3^{2} Posts 
Quote:
Last fiddled with by sghodeif on 20060614 at 18:36 

20060615, 20:44  #7  
"Curtis"
Feb 2005
Riverside, CA
1000110001011_{2} Posts 
Quote:
Clearly, noting that there is an infinite sequence of primes for n=1 is trivial. If you'd like to share some examples of appropiate length, with the method you used to prove them, I'm all ears. curtis 

20060617, 09:07  #8 
Sep 2005
2·3^{2} Posts 
the search for primes not like that?
Instead of wasting time with this search to find primes, my advice is u must search for an infinite sequence of primes to solve this .best regards .

20060617, 14:23  #9 
Oct 2005
Fribourg, Switzerlan
FC_{16} Posts 
...
Last fiddled with by victor on 20060617 at 14:25 
20060617, 15:03  #10 
Nov 2003
2×1,811 Posts 
sghodeif
We are happy for your showing interest in prime search and in our project. But I'm afraid information available on our RPS forum cannot provide you adequate introduction to search for large primes. Therefore, can I suggest you to have a look, for example here (specially Section IV), for some related background.
Thank you for your cooperation. ps. I'll be moving your questions and our replies to a separate thread shortly. 
20060619, 10:19  #11 
May 2005
2·809 Posts 
Victor
Picture says more than thousand words 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Many (gmp)ecm questions...  WraithX  GMPECM  26  20140403 15:54 
Two questions:  Dubslow  GPU Computing  1  20110805 18:22 
Some questions...  OmbooHankvald  PSearch  3  20050917 19:29 
5 questions  OmbooHankvald  Factoring  6  20050828 19:31 
Questions  OmbooHankvald  Prime Sierpinski Project  2  20050801 20:18 