| 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
Create the page "Riesel prime 7" on this wiki! See also the search results found.
Page title matches
- {{Riesel prime |Rk=73 KB (264 words) - 22:08, 5 July 2023
- {{Riesel prime |Rb=7388 bytes (29 words) - 16:47, 22 March 2024
Page text matches
- ...^\infty \frac{1}{p_i} = \frac{1}{2} + \frac{1}{3} + \frac{1}{5} + \frac{1}{7} + \frac{1}{11} + \dotsb = \infty</math></pre> ...^\infty \frac{1}{p_i} = \frac{1}{2} + \frac{1}{3} + \frac{1}{5} + \frac{1}{7} + \frac{1}{11} + \dotsb = \infty</math>11 KB (1,236 words) - 14:41, 3 September 2020
- ...}. On the other hand, 15 = 16 − 1 = {{Kbn|4}}, for example, is not a prime, because 15 is divisible by 3 and 5. ...ion; in the 4th century BC [[Euclid]] demonstrated that if M is a Mersenne prime then M(M+1)/2 is a perfect number. Two millennia later, in the 18th century5 KB (857 words) - 14:53, 19 September 2021
- {{Riesel prime 7935 bytes (70 words) - 18:56, 10 December 2022
- {{Riesel prime 7;T:S490 bytes (35 words) - 12:22, 11 December 2022
- *{{Kbn|+|78557|3n+1}} is multiple of 7. (those values form a [[covering set]] of {3, 5, 7, 13, 19, 37, 73}) we can prepare the following table for the exponents modu5 KB (650 words) - 10:25, 26 March 2024
- ...2^{2p^n}+2^{p^n}+1 \ = \ (2^{p^{n+1}}-1)/(2^{p^n}-1)</math> where p is the prime of apparition rank r (r(2)=1, r(3)=2, r(5)=3, ...) and n is greater or equa #If number <math>\sum_{i=0}^{p-1}\ (2^i)^{m} \ </math> is prime, then <math>m=p^n</math>.5 KB (726 words) - 09:57, 12 September 2021
- ..., 23 is a Sophie Germain prime because it is a prime and 2*23+1 = 47, also prime. | 7 || 41 || {{NRi|21|1}}1 KB (171 words) - 04:26, 3 November 2020
- Although there's no official definition of a '''Riesel prime''' mostly all primes of the form {{Kbn|k|n}} with 2<sup>{{Vn}}</sup> > {{Vk ...2 #1 (2016-02-11)] - [https://www.mersenneforum.org/showpost.php?p=541048 #7 (2020-03-27)]2 KB (279 words) - 03:48, 24 April 2024
- {{DISPLAYTITLE:Riesel problem, {{Kbn|-|k|2|n}}, {{Vk}} < {{Num|509203}}}} The '''Riesel problem''' involves determining the smallest [[Riesel number]].6 KB (689 words) - 18:14, 4 April 2024
- {{Riesel prime 7;C:'''[[M4]]''', {{NWo|-|5}}, {{NWo|8|2}}, {{NWo|128|1}}2 KB (288 words) - 11:41, 3 April 2023
- {{Riesel prime 7;T:W;C:{{NWo|6}}5 KB (523 words) - 09:47, 5 October 2023
- {{Riesel prime |Rk=73 KB (264 words) - 22:08, 5 July 2023
- {{Riesel prime ...ks=This sequence is independently searched only for {{Vn}}-values == 0 mod 7 of {{NRi|127|n}}.<br>See also {{NWi|MM|128|n}}3 KB (327 words) - 05:57, 19 April 2024
- {{Williams prime |WiMaxn={{#expr:floor({{GP|Riesel prime 2 7|RMaxn}}/3)}}291 bytes (42 words) - 20:52, 31 July 2021
- {{Riesel prime 72 KB (228 words) - 19:30, 19 July 2023
- {{Riesel prime |RRemarks=This sequence is not searched for {{Vn}}-values ≡ 0 mod 7 (see {{NRi|127|128|n}}).2 KB (184 words) - 22:47, 18 April 2024
- {{Williams prime |WiMaxn={{GP|Riesel prime 128 127|RMaxn}}277 bytes (36 words) - 14:08, 16 March 2023
- {{Riesel prime 7;T:T4 KB (357 words) - 23:04, 19 April 2024
- {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|b|n}}, least {{Vn}}-values}} Here are shown the least {{Vn}} ≥ 1 generating a [[Riesel prime]] of the form {{Kbn|k|b|n}} for 2 ≤ {{Vb}} ≤ 1030 and 2 ≤ {{Vk}} &6 KB (684 words) - 09:40, 17 March 2024
- {{Williams prime |WiMaxn={{#expr:floor({{GP|Riesel prime 2 129|RMaxn}}/7)}}324 bytes (41 words) - 14:25, 1 August 2021
