mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Blogorrhea > sweety439

Reply
 
Thread Tools
Old 2022-03-23, 19:04   #23
sweety439
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

72·73 Posts
Default

Quote:
Originally Posted by rudy235 View Post
211213-1 would _not_ use BLS or CHG for N-1 as in this case LL is quicker. On the other hand R1031 was proven by a procedure similar to BLS Brillhart-Lehmer-Selfridge

See https://www.ams.org/journals/mcom/19...-0856714-3.pdf
Well ....

k*b^n+1 for b not power of 2 and b^n > k: Pocklington N-1 primality test
k*2^n+1 for k not power of 2 and 2^n > k: Proth primality test
2^n+1: Pรฉpin primality test for Fermat numbers

k*b^n-1 for b not power of 2 and b^n > k: Morrison N+1 primality test
k*2^n-1 for k not power of 2 and 2^n > k: Lucasโ€“Lehmerโ€“Riesel primality test
2^n-1: Lucasโ€“Lehmer primality test for Mersenne numbers

Last fiddled with by sweety439 on 2022-03-23 at 19:05
sweety439 is offline   Reply With Quote
Old 2022-05-07, 08:51   #24
sweety439
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

DF916 Posts
Default Predict the smallest integer n such that 67607*2^n+1 is prime

Sierpinski conjectured that 78557 is the smallest odd k such that k*2^n+1 is composite for all integer n (for k = 78557, k*2^n+1 must be divisible by at least one of {3, 5, 7, 13, 19, 37, 73}, thus cannot be prime), and so far, all but 5 smaller odd k have a known prime of the form k*2^n+1, these 5 odd k with no known prime of the form k*2^n+1 are {21181, 22699, 24737, 55459, 67607}, and for these 5 k-values, 67607 has the lowest Nash weight, and thus I think that 67607 has the largest first prime of the form k*2^n+1 among these 5 k-values (and hence also among all odd k-values smaller than 78557), so, let's guess the range of the n for k = 67607

(currently, 67607*2^n+1 has been tested to 36M (> 2^25) without primes found, thus n < 2^25 is impossible)

Last fiddled with by sweety439 on 2022-05-07 at 08:58
sweety439 is offline   Reply With Quote
Old 2022-05-07, 10:06   #25
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

9,941 Posts
Default

Predict based on what? Are you, perhaps, a blonde?

https://www.reddit.com/r/Jokes/comme...et_a_dinosaur/
Batalov is offline   Reply With Quote
Old 2022-05-11, 07:45   #26
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
"name field"
Jun 2011
Thailand

2·5,059 Posts
Default

Quote:
Originally Posted by Batalov View Post
Are you, perhaps, a blonde?
That is nothing "blonde" in that, as the question is asked, the chances are indeed 50%.

LaurV is offline   Reply With Quote
Old 2022-05-21, 08:14   #27
sweety439
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

1101111110012 Posts
Default

Quote:
Originally Posted by mart_r View Post
So when will R86453 be verified?
When will 8*13^32020+183 (the largest minimal prime in base 13, see https://github.com/curtisbright/mepn...minimal.13.txt and https://cs.uwaterloo.ca/~cbright/reports/mepn.pdf) be verified? Also see this article.

(if this number is verified, then we will complete the classification of the minimal elements of the primes in base 13, since all other minimal primes in base 13 are < 10^345, thus easily to be proven primes)

Last fiddled with by sweety439 on 2022-05-21 at 08:37
sweety439 is offline   Reply With Quote
Old 2022-05-21, 08:46   #28
sweety439
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

72×73 Posts
Default

Quote:
Originally Posted by frmky View Post
(3602,2577) and (3646,2389) are done and uploaded. (3543,3052) is running now.
Can you prove the primality of these PRPs which are in order to prove the Riesel and Sierpinski conjecture?

* (79*73^9339-1)/6 (R73)
* (27*91^5048-1)/2 (R91)
* (133*100^5496-1)/33 (R100)
* (3*107^4900-1)/2 (R107)
* (27*135^3250-1)/2 (R135)
* (201*141^5279-1)/20 (R141)
* (1*174^3251-1)/173 (R174)
* (11*175^3048-1)/2 (R175)
* (191*105^5045+1)/8 (S105)
* (11*256^5702+1)/3 (S256)

Except the first and the last of these, they are smaller than your 3543^3052+3052^3543

I think they are more interesting than Leyland numbers, since they are of the form (a*b^n+c)/gcd(a+c,b-1) (with a>=1, b>=2, c != 0, gcd(a,c) = 1, gcd(b,c) = 1), this includes the classic sequences:

* Mersenne numbers 2^n-1
* 2^n+1
* k*2^n-1
* k*2^n+1
* Generalized repunits in base b: (b^n-1)/(b-1) (see http://www.fermatquotient.com/PrimSerien/GenRepu.txt)
* b^n+1 for even b (see http://jeppesn.dk/generalized-fermat.html)
* (b^n+1)/2 for odd b (see http://www.fermatquotient.com/PrimSerien/GenFermOdd.txt)
* k*b^n+1 (Sierpinski conjecture base b)
* k*b^n-1 (Riesel conjecture base b)

etc.

Last fiddled with by sweety439 on 2022-05-21 at 08:51
sweety439 is offline   Reply With Quote
Old 2022-05-21, 10:20   #29
xilman
Bamboozled!
 
xilman's Avatar
 
"๐’‰บ๐’ŒŒ๐’‡ท๐’†ท๐’€ญ"
May 2003
Down not across

2CEC16 Posts
Default

Quote:
Originally Posted by sweety439 View Post
Can you prove the primality of these PRPs which are in order to prove the Riesel and Sierpinski conjecture?

* (79*73^9339-1)/6 (R73)
* (27*91^5048-1)/2 (R91)
* (133*100^5496-1)/33 (R100)
* (3*107^4900-1)/2 (R107)
* (27*135^3250-1)/2 (R135)
* (201*141^5279-1)/20 (R141)
* (1*174^3251-1)/173 (R174)
* (11*175^3048-1)/2 (R175)
* (191*105^5045+1)/8 (S105)
* (11*256^5702+1)/3 (S256)

Except the first and the last of these, they are smaller than your 3543^3052+3052^3543

I think they are more interesting than Leyland numbers, since they are of the form (a*b^n+c)/gcd(a+c,b-1) (with a>=1, b>=2, c != 0, gcd(a,c) = 1, gcd(b,c) = 1), this includes the classic sequences:

* Mersenne numbers 2^n-1
* 2^n+1
* k*2^n-1
* k*2^n+1
* Generalized repunits in base b: (b^n-1)/(b-1) (see http://www.fermatquotient.com/PrimSerien/GenRepu.txt)
* b^n+1 for even b (see http://jeppesn.dk/generalized-fermat.html)
* (b^n+1)/2 for odd b (see http://www.fermatquotient.com/PrimSerien/GenFermOdd.txt)
* k*b^n+1 (Sierpinski conjecture base b)
* k*b^n-1 (Riesel conjecture base b)

etc.
Why not prove them yourself?

I found it very easy to get ecpp-mpi running. It is now churning away on one of my systems which is testing 45986-bit PRP. At 45618 bits the last of your list is smaller than the one I am running so it should not be too difficult for your resources.
xilman is offline   Reply With Quote
Old 2022-05-21, 12:23   #30
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

428410 Posts
Default

Quote:
Originally Posted by sweety439 View Post
When will 8*13^32020+183 (the largest minimal prime in base 13, see https://github.com/curtisbright/mepn...minimal.13.txt and https://cs.uwaterloo.ca/~cbright/reports/mepn.pdf) be verified? Also see this article.

(if this number is verified, then we will complete the classification of the minimal elements of the primes in base 13, since all other minimal primes in base 13 are < 10^345, thus easily to be proven primes)
@sweety439. This seems to be a regular question from you: "when will someone prove...". You really need to get FastECPP running on your system, even if you are stuck with Windows; Simple download and install WSL2. Then you can install and run Linux Ubuntu in the WSL2 virtual system. From there you will have download some packages like openmpi, build-essential, pari-dev, gmp-dev and whatever is required by CM (FastECPP). Et voila, you'll be able to prove some numbers prime. What inhibits you from doing all this?

Last fiddled with by paulunderwood on 2022-05-21 at 12:43
paulunderwood is offline   Reply With Quote
Old 2022-05-21, 13:03   #31
xilman
Bamboozled!
 
xilman's Avatar
 
"๐’‰บ๐’ŒŒ๐’‡ท๐’†ท๐’€ญ"
May 2003
Down not across

22·53·23 Posts
Default

Quote:
Originally Posted by paulunderwood View Post
@sweety439. This seems to be a regular question from you: "when will someone prove...". You really need to get FastECPP running on your system, even if you are stuck with Windows; Simple download and install WSL2. Then you can install and run Linux Ubuntu in the WSL2 virtual system. From there you will have download some packages like openmpi, build-essential, pari-dev, gmp-dev and whatever is required by CM (FastECPP). Et voila, you'll be able to prove some numbers prime. What inhibits you from doing all this?
No-one is ever stuck with Windows.

As well as the WSL solution it is always possible to dual-boot a system.
xilman is offline   Reply With Quote
Old 2022-05-21, 22:29   #32
mathwiz
 
Mar 2019

1001011112 Posts
Default

Quote:
Originally Posted by sweety439 View Post
Can you prove the primality of these PRPs
Stop asking others to do the work for you. Learn to use the tools yourself.
mathwiz is offline   Reply With Quote
Old 2022-05-21, 23:01   #33
chalsall
If I May
 
chalsall's Avatar
 
"Chris Halsall"
Sep 2002
Barbados

1066610 Posts
Default

Quote:
Originally Posted by xilman View Post
No-one is ever stuck with Windows. As well as the WSL solution it is always possible to dual-boot a system.
Or, even, simply not have WinBlows in the equation at all.

I recently fired a client because I was fed up with dealing with their WinCrows machines self-destructing.

I was very clear that I was more than happy to continue to support their Linux-based backend systems, but I would no longer support their workstations. I gave them several suggestions for those who would be willing to support them; I never abandon a client.

BTW... The client was my girlfriend...
chalsall is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Off topic kriesel kriesel 6 2021-01-16 16:31
Off topic - board games on the web robert44444uk Lounge 3 2019-03-05 08:51
Side Topic: 'It's Not a Toom-ah' R.D. Silverman Math 68 2015-11-15 04:21
Topic of Peepholes Friendship :) coffee1054 Lounge 7 2012-02-17 03:38
AMD vs. Intel topic Pjetro Hardware 11 2002-11-04 21:00

All times are UTC. The time now is 12:12.


Fri Sep 30 12:12:47 UTC 2022 up 43 days, 9:41, 0 users, load averages: 0.93, 1.04, 1.08

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

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

โ‰  ยฑ โˆ“ รท ร— ยท โˆ’ โˆš โ€ฐ โŠ— โŠ• โŠ– โŠ˜ โŠ™ โ‰ค โ‰ฅ โ‰ฆ โ‰ง โ‰จ โ‰ฉ โ‰บ โ‰ป โ‰ผ โ‰ฝ โŠ โŠ โŠ‘ โŠ’ ยฒ ยณ ยฐ
โˆ  โˆŸ ยฐ โ‰… ~ โ€– โŸ‚ โซ›
โ‰ก โ‰œ โ‰ˆ โˆ โˆž โ‰ช โ‰ซ โŒŠโŒ‹ โŒˆโŒ‰ โˆ˜ โˆ โˆ โˆ‘ โˆง โˆจ โˆฉ โˆช โจ€ โŠ• โŠ— ๐–• ๐–– ๐–— โŠฒ โŠณ
โˆ… โˆ– โˆ โ†ฆ โ†ฃ โˆฉ โˆช โŠ† โŠ‚ โŠ„ โŠŠ โŠ‡ โŠƒ โŠ… โŠ‹ โŠ– โˆˆ โˆ‰ โˆ‹ โˆŒ โ„• โ„ค โ„š โ„ โ„‚ โ„ต โ„ถ โ„ท โ„ธ ๐“Ÿ
ยฌ โˆจ โˆง โŠ• โ†’ โ† โ‡’ โ‡ โ‡” โˆ€ โˆƒ โˆ„ โˆด โˆต โŠค โŠฅ โŠข โŠจ โซค โŠฃ โ€ฆ โ‹ฏ โ‹ฎ โ‹ฐ โ‹ฑ
โˆซ โˆฌ โˆญ โˆฎ โˆฏ โˆฐ โˆ‡ โˆ† ฮด โˆ‚ โ„ฑ โ„’ โ„“
๐›ข๐›ผ ๐›ฃ๐›ฝ ๐›ค๐›พ ๐›ฅ๐›ฟ ๐›ฆ๐œ€๐œ– ๐›ง๐œ ๐›จ๐œ‚ ๐›ฉ๐œƒ๐œ— ๐›ช๐œ„ ๐›ซ๐œ… ๐›ฌ๐œ† ๐›ญ๐œ‡ ๐›ฎ๐œˆ ๐›ฏ๐œ‰ ๐›ฐ๐œŠ ๐›ฑ๐œ‹ ๐›ฒ๐œŒ ๐›ด๐œŽ๐œ ๐›ต๐œ ๐›ถ๐œ ๐›ท๐œ™๐œ‘ ๐›ธ๐œ’ ๐›น๐œ“ ๐›บ๐œ”