|
2018-12-03, 19:33
|
#12 |
|
Mar 2018
2×5×53 Posts |
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...
Last fiddled with by enzocreti on 2018-12-03 at 19:33 |
|
|
|
2018-12-03, 19:59
|
#13 | |
"Forget I exist"
Jul 2009
Dumbassville
100000110000002 Posts |
Quote:
|
|
|
|
|
|
2018-12-04, 08:48
|
#14 |
|
Mar 2018
10000100102 Posts |
Routine for Sage in 40!+k project
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? |
|
|
|
|
2018-12-04, 09:25
|
#15 |
|
Mar 2018
53010 Posts |
3500+ views on mathoverflow
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
|
|
|
|
|
2018-12-05, 05:38
|
#16 | |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
100101000001012 Posts |
Quote:
|
|
|
|
|
|
2018-12-06, 01:58
|
#17 | |
Aug 2006
3·1,993 Posts |
Quote:
|
|
|
|
|
|
2018-12-06, 03:00
|
#18 |
|
"Forget I exist"
Jul 2009
Dumbassville
838410 Posts |
|
|
|
|
|
2018-12-06, 05:34
|
#19 | |
|
Mar 2018
2×5×53 Posts |
MO
Quote:
His post is CLOSED, mine not! |
|
|
|
|
 |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| GPU LLR program | jasong | GPU Computing | 19 | 2011-08-23 03:32 |
| about the program | boooh | Information & Answers | 2 | 2010-03-22 15:22 |
| Program | Primeinator | Information & Answers | 5 | 2009-07-16 21:42 |
| program P-1 for K*2^n-1 | jocelynl | 15k Search | 19 | 2004-01-11 17:24 |
