mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Lounge (https://www.mersenneforum.org/forumdisplay.php?f=7)
-   -   Unhappy in choosing prime sequence :-) (https://www.mersenneforum.org/showthread.php?t=22461)

pepi37 2017-07-15 17:56

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 :smile:
What is your suggestion/advice ?

paulunderwood 2017-07-15 18:14

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. :smile:

science_man_88 2017-07-15 18:18

[QUOTE=pepi37;463468]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 :smile:
What is your suggestion/advice ?[/QUOTE]

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 ?

Batalov 2017-07-15 18:20

[QUOTE=pepi37;463468]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 :smile:
What is your suggestion/advice ?[/QUOTE]
Your question contains the answer. :rolleyes:
So the answer to your question is: yes.

pepi37 2017-07-15 18:27

[QUOTE=paulunderwood;463469]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. :smile:[/QUOTE]
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 :)

pepi37 2017-07-15 18:33

[QUOTE=science_man_88;463470]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 ?[/QUOTE]

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" :)

pepi37 2017-07-15 18:35

[QUOTE=Batalov;463471]Your question contains the answer. :rolleyes:
So the answer to your question is: yes.[/QUOTE]

Crystal clear answer :smile: :bow::bow::bow::bow::bow:

What else to do : make deeper sieve, and wait :smile:

pinhodecarlos 2017-07-15 18:38

be patient

pepi37 2017-07-15 18:39

[QUOTE=pinhodecarlos;463477]be patient[/QUOTE]

2:0 to be patient :)
So it must be only good answer :)

a1call 2017-07-15 19:53

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.

:smile:


All times are UTC. The time now is 21:42.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.