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

Search results

Jump to: navigation, search
  • {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|10|n}}}} ...www.noprimeleftbehind.net/gary/primes-kx10n-1.htm Primes of the form {{Kbn|k|10|n}}] compiled by [[Gary Barnes]]
    681 bytes (93 words) - 13:01, 2 August 2021
  • __NOTOC__{{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, {{Num|25000}} ≤ {{Vk}} ≤ {{Num|100000}}}}
    1 KB (165 words) - 09:15, 22 July 2021
  • *Purpose: The goal of this drive is to search for primes of the form {{Kbn|k|2|n}} for 13 high-weighted 2000 < {{Vk}} < 2300. *k-values: 2043, 2049, 2061, 2079, 2085, 2103, 2127, 2205, 2211, 2253, 2259, 2
    537 bytes (60 words) - 10:53, 11 January 2023
  • {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}} with missing ranges}}
    1 KB (192 words) - 09:07, 23 September 2021
  • To solve the [[Sierpiński problem]] by finding a prime of the form {{Kbn|+|k|n}} for each remaining value of {{Vk}} < 78,557.
    1 KB (135 words) - 11:42, 5 September 2021
  • ...{Vk}} < 271129 must be shown to produce a prime number of the form {{Kbn|+|k|n}}.
    2 KB (254 words) - 11:43, 5 September 2021
  • {{DISPLAYTITLE:Proth numbers of the form {{Kbn|+|k|n}} with {{Vk}} mod 3 = 0}} Proth numbers {{Kbn|+|k|n}} where {{Vk}}-value is a multiple of 3.
    1 KB (156 words) - 09:18, 23 July 2021
  • ...like the [[Sierpiński problem]] but with first prime at <math>n > \log_2(k)</math>
    461 bytes (62 words) - 07:27, 25 January 2024
  • The project searched for [[Fermat divisor]]s of the form {{Kbn|+|k|2|n}}, for the following ranges:<ref name="table"/>
    4 KB (448 words) - 09:13, 7 September 2021
  • {{DISPLAYTITLE:Riesel problem 2, {{Kbn|-|k|2|n}}, {{Num|509203}} < {{Vk}} < {{Num|762701}}}} ...esel problem''' involves determining the smallest [[Riesel number]]s {{Kbn|k|2|n}} for 509203 &lt; {{Vk}} &lt; 762701, the first and second Riesel {{Vk}
    4 KB (386 words) - 06:41, 29 March 2024
  • {{DISPLAYTITLE:Proth numbers of the form {{Kbn|+|k|n}} with {{Vk}} mod 15 = 0}} Proth numbers {{Kbn|+|k|n}} where {{Vk}}-value is a multiple of 15.
    1 KB (156 words) - 09:22, 23 July 2021
  • {{DISPLAYTITLE:Proth numbers of the form {{Kbn|+|k|n}} with {{Vk}} mod 2145 = 0}} Proth numbers {{Kbn|+|k|n}} where {{Vk}}-value is a multiple of 2145.
    1 KB (156 words) - 09:36, 23 July 2021
  • {{DISPLAYTITLE:Proth numbers of the form {{Kbn|+|k|n}} with {{Vk}} mod 2805 = 0}} Proth numbers {{Kbn|+|k|n}} where {{Vk}}-value is a multiple of 2805.
    1 KB (158 words) - 09:16, 22 March 2024
  • {{DISPLAYTITLE:Proth primes of the form {{Kbn|+|k|n}}, {{Vk}} < 300}}
    850 bytes (117 words) - 17:18, 25 July 2021
  • {{DISPLAYTITLE:Sierpiński numbers of the form {{Kbn|+|k|n}}}} '''Sierpiński numbers''' are odd numbers {{Vk}} for which {{Kbn|+|k|n}} is composite for all natural numbers {{Vn}}.
    741 bytes (99 words) - 21:18, 17 December 2023
  • {{DISPLAYTITLE:Proth numbers of the form {{Kbn|+|k|n}} with no prime value so far}} Proth numbers {{Kbn|+|k|n}} where no prime values are known.
    867 bytes (117 words) - 07:46, 26 July 2021
  • {{DISPLAYTITLE:Proth numbers of the form {{Kbn|+|k|n}} with 100 and more primes}} Proth numbers {{Kbn|+|k|n}} with 100 or more prime values {{Vn}}.
    916 bytes (122 words) - 07:51, 26 July 2021
  • {{DISPLAYTITLE:Proth primes of the form {{Kbn|+|k|n}} with missing ranges}}
    778 bytes (107 words) - 07:57, 26 July 2021
  • {{DISPLAYTITLE:Proth primes of the form {{Kbn|+|k|n}}, 300 < {{Vk}} < 2000}}
    873 bytes (117 words) - 08:15, 26 July 2021
  • {{DISPLAYTITLE:Proth primes of the form {{Kbn|+|k|n}}, 2000 < {{Vk}} < 4000}}
    878 bytes (117 words) - 08:17, 26 July 2021

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)