ruveyn wrote:
makuranososhi wrote:
The remainder of the first hundred prime numbers, in the same format of 2A+B where A & B are both prime numbers as well.
M.
That does not prove the general statement. Enumerating particular cases will not prove the generality.
ruveyn
But it can disprove a statement, so it is a good first step. Once you have more data building a theorem is typically easier.
- - -
Ive always held that we should use base 12. In {2..12} only {5,7,11} are relatively prime with 12, so for any other number on that range we can use the same sort of trick for divisibility as we do for 2's and 5's in base 10. Never mind ease of multiplication by 2, 3, 4, and 6.
It also benefits the metric system, as 1.2 meters is a commonly used unit in some applications (I believe lumber is sold in such lengths, but I use feet). It would allow the metric system to retain the simplicity of an exponential series and the ease of use of being highly factorable.
Similar consideration was given to the development of degrees, an arbitrary unit chosen to facilitate ease of use by hand.
- - -
As for efficiency of finding new primes, I believe the Sieve of Atkin is still considered optimized. I looked at it a few years ago when I thought of personally making a number sieve to investigate primes. If memory serves about how it works, and if I am not making an obvious mistakes in this nearly waking hell at 5:36AM, after 3 hours of sleep, it is superior to yours as the size of primes considered grow large.