![]() |
|
|
#12 | |
|
"Serge"
Mar 2008
San Diego, Calif.
32×7×163 Posts |
Quote:
"When I was a child, I spake as a child, I understood as a child, I thought as a child: but when I became a man, I put away childish things." |
|
|
|
|
|
|
#13 | |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
6,793 Posts |
Quote:
You either have some mathematical basis or you don't. No amount of bets or empirical results will change that. |
|
|
|
|
|
|
#14 |
|
"ม้าไฟ"
May 2018
2·3·89 Posts |
|
|
|
|
|
|
#15 |
|
"ม้าไฟ"
May 2018
10000101102 Posts |
As I wrote in another post, this is an empirical work at this stage. The mathematical basis has to be extended to cover the gray area after trials and errors (lots of them).
|
|
|
|
|
|
#16 |
|
"David Kirkby"
Jan 2021
Althorne, Essex, UK
7128 Posts |
I will at some point implement a method so my dog picks an exponent! Getting her to tread on the keyboard should be easy enough.
I did at one point test a few exponents which have a twin-prime below the exponent I was testing, based on this observation https://www.mersenneforum.org/showthread.php?t=26812 However, manual assignments are larger than the category 0 & 1 exponents I can get from the server, so take longer to test. I guess, if I wanted, I could set GetMinExponent & GetMaxExponent in local.txt to get category 1 assignments of the twin-primes. But I'm not convinced the observation is any more than pure chance, so I am not bothering. There's someone on here doing testing of exponents in a certain range, based on some mad idea he has. I think I would keep quite if I had such a stupid idea, but otherwise I don't see any reason to keep quite about testing strategies. Last fiddled with by drkirkby on 2021-07-18 at 11:00 |
|
|
|
|
|
#17 | |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
6,793 Posts |
Quote:
And so far no one has said you are wrong (or right). You might be right, but without some actual analysis other than "I eyeballed the graph" then there is no way to know. And making your claim contingent upon a single future result is very reckless IMO. Your claim might still be correct (we don't know) even if the next prime is outside of what you predict. |
|
|
|
|
|
|
#18 | |
|
"ม้าไฟ"
May 2018
2·3·89 Posts |
Quote:
Manual testing is concerned with Category 4 assignments and they take much longer to test indeed (years per exponent). Anyway, using empirical strategies or not, the amount of work done by the volunteers would remain the same, so the GIMPS performance would remain unaffected. |
|
|
|
|
|
|
#19 | |
|
"ม้าไฟ"
May 2018
2·3·89 Posts |
Quote:
Meanwhile, substantial work could be done to better understand the empirical observations. |
|
|
|
|
|
|
#20 |
|
"Composite as Heck"
Oct 2017
2·52·19 Posts |
That assumes every observation gets us closer to some grand theorem, the vast majority of observations actually obscure what mathematical dots can be meaningfully connected. Don't get me wrong it can be fun to be a crank and massage sequences and concepts into some eldritch horror of a theorem, but in the end it's no more meaningful than completing a crossword puzzle.
|
|
|
|
|
|
#21 | ||
|
Apr 2020
3×353 Posts |
Quote:
![]() In the words of Joe Biden, "C'mon, man!" Before you immediately accuse someone of malice, stop and think whether there might be any other explanation for what they've done. It's true that for p=3 and p=5, the heuristic gives a probability exceeding 1. But the fact that I didn't adjust these probabilities down to exactly 1 (after all, we know they're prime) in the graph was an honest mistake; I just hadn't checked whether the heuristic always gave reasonable values for small primes. I only discovered the mistake later, and I didn't correct the graph because I hoped any sane person would understand that this would only matter for a couple of very small values of p. I've attached a corrected version so you can see just how little difference there is. ![]() It's not that I don't necessarily believe in the heuristic. There are good reasons for thinking it might be true, and I have no reason to disbelieve it, but I would not be totally shocked if someone were to prove it wrong, whereas I would be shocked if someone disproved the Goldbach conjecture, for example. By the way, the heuristic is only linear in the limit. The version I've been using is the following: Quote:
Of course the probabilities for higher digit sums tend to zero, because we've only searched up to p a little over 100M. That doesn't contradict any of what I said. The graph does not say anything about probabilities for higher exponents that we haven't searched yet! |
||
|
|
|
|
|
#22 | |
|
"ม้าไฟ"
May 2018
2×3×89 Posts |
Quote:
Rather than proving a grand theorem, one could potentially use software tools to eliminate possibilities and end up with a limited set of exponents for a given strategy. Please do not misunderstand me, we are far from applying this directly in number theory at present. But if thinking about it strategically, imagine a future version of Prime95 in the next 10-15 years (I hope to be still around) which has "Select Assignment" and also "Select Team Strategy" options. |
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Manual testing | tait1k27 | Information & Answers | 10 | 2020-03-17 09:55 |
| Manual Testing CPU | Unregistered | Information & Answers | 6 | 2019-12-17 23:35 |
| Manual testing | artmel | Information & Answers | 1 | 2019-02-04 21:05 |
| Manual testing on CPU list | Fred | PrimeNet | 3 | 2016-02-12 02:49 |
| Manual Testing | Unregistered | Information & Answers | 2 | 2009-01-17 14:13 |