Program for Sage

[enzocreti]

I said that for me a proof is out of reach...I believe that these primes pop up in a very ordered way...maybe 6 mod 7 primes of this form actually do not exist...the fact that I found five probable primes 5 mod 7 in a row for me is quite astonoshing, unless you imagine that there is an hidden structure...

[science_man_88]

Originally Posted by enzocreti

I said that for me a proof is out of reach...

until you give a proper mathematical argument, you are unlikely to see much help here then. what properties does the more general form (2n+1)*10^r +n have that may be of use ?

[enzocreti]

The object is to find all integers k , lets say in the range [-10^9,10^9], for which the number 40!+k splits in three prime factors with 16 decimal digits.
Has somebody an efficient routine for Sage?

[enzocreti]

My post has more than 3500 views on mathoverflow and more than 5600 in mathexchange, I think that could not be possible if the numbers were completely senseless

[Batalov]

Originally Posted by enzocreti

My post has more than 3500 views on mathoverflow and more than 5600 in mathexchange, I think that could not be possible if the numbers were completely senseless

Do you know the aphorism "a million flies can't be wrong"?

[CRGreathouse]

Originally Posted by enzocreti

My post has more than 3500 views on mathoverflow and more than 5600 in mathexchange, I think that could not be possible if the numbers were completely senseless

Olivier has twice as many views on MO asking for an algorithm for all of algebraic geometry.

[science_man_88]

https://www.youtube.com/watch?v=bPZFQ6i759g&app=desktop

Also:

https://www.youtube.com/watch?v=pOLmD_WVY-E&app=desktop

[enzocreti]

Originally Posted by CRGreathouse

Olivier has twice as many views on MO asking for an algorithm for all of algebraic geometry.

His post is CLOSED, mine not!