mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   enzocreti (https://www.mersenneforum.org/forumdisplay.php?f=156)
-   -   Prime (4436714570233827*2^2552+1) (https://www.mersenneforum.org/showthread.php?t=24378)

enzocreti 2019-05-02 15:02

Primes of the form 4436714570233827*2^255...5552+1
 
4436714570233827*2^52+1 is prime
4436714570233827*2^252+1 is prime
4436714570233827*2^2552+1 is prime


Is it possible with Pfgw to find if it exists another prime of the form


4436714570233827*2^255...552+1?

enzocreti 2019-05-02 15:40

Prime (4436714570233827*2^2552+1)
 
(4436714570233827*2^2552+1)=p is prime, a Proth prime.


The number of decimal digits of p is 28^2=784


p is congruent to (28+1=29) mod 28.


Nice property?

LaurV 2019-05-02 16:08

yes

enzocreti 2019-05-02 16:21

primes p
 
this is a Proth prime with a special form...
but there are arbitrary primes p such that p-1 is congruent to sqrt(number of decimal digits of p) mod sqrt(number of decimal digits of p)?

CRGreathouse 2019-05-02 16:49

[QUOTE=enzocreti;515510]this is a Proth prime with a special form...
but there are arbitrary primes p such that p-1 is congruent to sqrt(number of decimal digits of p) mod sqrt(number of decimal digits of p)?[/QUOTE]

Let's rephrase. Are there infinitely many integers d such that there is a prime [$]p\equiv 1 \pmod d[/$] in the range
$$
10^{d^2-1} < p < 10^{d^2}?
$$

Seems certain, I'll leave it to others to decide if it is provable.

VBCurtis 2019-05-02 18:22

I don't understand how you can post thread after thread of the same sort of "wow, I found this, can you find more?" without learning how to use the tools that find more. Please, learn pfgw. Maybe learn newpgen to create files of candidates while sieving out ones with small factors.

I hope you've at least concluded that you can find a prime for lots and lots of combinations fixing three of {a,b,c,d} in a*b^c+d (subject to d not divisible by b) by iterating over the letter you don't fix. There are exceptions, and they're somewhat rare; you keep exhibiting items that aren't rare, with marvel that they exist. Why shouldn't they exist?

enzocreti 2019-05-02 19:46

proth-primes
 
[QUOTE=CRGreathouse;515512]Let's rephrase. Are there infinitely many integers d such that there is a prime [$]p\equiv 1 \pmod d[/$] in the range
$$
10^{d^2-1} < p < 10^{d^2}?
$$

Seems certain, I'll leave it to others to decide if it is provable.[/QUOTE]




And is it possible to find in a smart way another proth-prime with this property?

VBCurtis 2019-05-02 21:18

Yes.

Batalov 2019-05-02 21:24

I am tired of moving a dozen threads from enzocreti from the wrong place to the right place - which is his blog area.

I will simply remove next ones that will be posted int he wrong place. Fair warning.

[COLOR="Red"][B]In addition: enzocreti[/B][/COLOR] - why do you start a new thread for every amazing new thingy? Just start one thread - "My amazing findings" and post all of them there. They are all the same - based on the strong law of small numbers. You can find a thousand more of these every day. We don't need a thousand threads "full of sound and fury, signifying nothing." You are very high maintenance.

Uncwilly 2019-05-02 21:30

[QUOTE=Batalov;515558]I am tired of moving a dozen threads from enzocreti from the wrong place to the right place - which is his blog area.
....

You are very high maintenance.[/QUOTE]Maybe Enzo needs a vacation.....

Batalov 2019-05-02 21:40

A single thread would be just fine.

Shirley, it will not be a newspaper column of Martin Gardner quality, but it will be in the same vein. He definitely enjoys it, and that's a great thing.


All times are UTC. The time now is 04:44.

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