| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "Proth prime 2 66741"
m (Karbon moved page Proth prime 66741 to Proth prime 2 66741 without leaving a redirect: renamed) |
(the Liskovets-Gallot conjecture for this one has been proved (adding "odd k", otherwise 2*9267 has unknown status)) |
||
| (One intermediate revision by one other user not shown) | |||
| Line 1: | Line 1: | ||
{{Proth prime | {{Proth prime | ||
|Pk=66741 | |Pk=66741 | ||
| + | |Pb=2 | ||
|PCount=9 | |PCount=9 | ||
|PNash=811 | |PNash=811 | ||
| Line 17: | Line 18: | ||
3767 | 3767 | ||
6837 | 6837 | ||
| − | |PRemarks=This {{Vk}}-value | + | |PRemarks=This {{Vk}}-value was proved in 2015 to be the smallest odd {{Vk}} ≡ 0 mod 3 for which {{Kbn|+|k|n}} is never prime for an even {{Vn}}. See [[Liskovets-Gallot conjectures]]. |
}} | }} | ||
==History== | ==History== | ||
{{HistC|2020-07-05|50000|Karsten Bonath}} | {{HistC|2020-07-05|50000|Karsten Bonath}} | ||
Latest revision as of 09:17, 10 May 2024
Current data
|
|
Remarks : |
This k-value was proved in 2015 to be the smallest odd k ≡ 0 mod 3 for which k•2n+1 is never prime for an even n. See Liskovets-Gallot conjectures. |
Notes
History
- 2020-07-05: Checked to n = 50000, Karsten Bonath
