mersenneforum.org Unhappy in choosing prime sequence :-)
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2017-07-15, 17:56 #1 pepi37     Dec 2011 After milion nines:) 1,487 Posts Unhappy in choosing prime sequence :-) Whatever sequence I choose I fail to find big prime (above 1.2M digits) So right question is- to change sequence when I reach some point, or to stick with few and be patient What is your suggestion/advice ?
 2017-07-15, 18:14 #2 paulunderwood     Sep 2002 Database er0rr 22·5·197 Posts Either you can look for light or heavy k sequences. Heavy has the advantage of the tests not taking as long. You might also consider a fixed n search.
2017-07-15, 18:18   #3
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts

Quote:
 Originally Posted by pepi37 Whatever sequence I choose I fail to find big prime (above 1.2M digits) So right question is- to change sequence when I reach some point, or to stick with few and be patient What is your suggestion/advice ?
how are you choosing the sequence? is it a polynomial , a recurrence, a special form like Mersennes? have you narrowed down the properties that may be stopping it from working ?

2017-07-15, 18:20   #4
Batalov

"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

100101100100102 Posts

Quote:
 Originally Posted by pepi37 Whatever sequence I choose I fail to find big prime (above 1.2M digits) So right question is- to change sequence when I reach some point, or to stick with few and be patient What is your suggestion/advice ?
So the answer to your question is: yes.

2017-07-15, 18:27   #5
pepi37

Dec 2011
After milion nines:)

1,487 Posts

Quote:
 Originally Posted by paulunderwood Either you can look for light or heavy k sequences. Heavy has the advantage of the tests not taking as long. You might also consider a fixed n search.
Primary I take sequences where K is 4 :)
So for last one 4*53^n+1 nash weight is 585. Also there is 4*155 and 4*212 and so on. But also there is few sequences of base 10, where also ( regardless much more weight) Ihave no luck :)
So I take various bases and various K :)

2017-07-15, 18:33   #6
pepi37

Dec 2011
After milion nines:)

148710 Posts

Quote:
 Originally Posted by science_man_88 how are you choosing the sequence? is it a polynomial , a recurrence, a special form like Mersennes? have you narrowed down the properties that may be stopping it from working ?
Gary told me in one message that sequences I choose is ordinary much harder to produce prime then "ordinary one" :)
So that may be price "I pay" :)

2017-07-15, 18:35   #7
pepi37

Dec 2011
After milion nines:)

1,487 Posts

Quote:
 Originally Posted by Batalov Your question contains the answer. So the answer to your question is: yes.

What else to do : make deeper sieve, and wait

 2017-07-15, 18:38 #8 pinhodecarlos     "Carlos Pinho" Oct 2011 Milton Keynes, UK 137D16 Posts be patient
2017-07-15, 18:39   #9
pepi37

Dec 2011
After milion nines:)

27178 Posts

Quote:
 Originally Posted by pinhodecarlos be patient
2:0 to be patient :)
So it must be only good answer :)

 2017-07-15, 19:53 #10 a1call     "Rashid Naimi" Oct 2015 Remote to Here/There 2×1,087 Posts This reminds me of a Mork and Mindy episode where Mork goes to a bank to open an account: Teller: Name? Mork: Mork, Teller: Is that your first name or last name? Mork: Yes.

 Similar Threads Thread Thread Starter Forum Replies Last Post xilman Lounge 1701 2021-09-26 01:55 Stan Miscellaneous Math 34 2013-08-25 17:35 davar55 Puzzles 16 2009-07-02 19:58 roger Puzzles 25 2007-02-09 15:50 Orgasmic Troll Math 10 2003-10-03 15:45

All times are UTC. The time now is 17:54.

Mon Dec 6 17:54:30 UTC 2021 up 136 days, 12:23, 0 users, load averages: 1.91, 1.95, 1.81