L
Lillen
Guest
I believe that the primes up to 19 (2,3,5,7,11,13,17,19,) can be used to calculate primes above those number, even 10 digit primes, in your head. If the ten digit number cannot be devided with those eight numbers it is a prime.
I have had this discussion before, were those who argued against me said that i was wrong because if you multply primes above 19 with eachother you will have a number that isn't fit in to those eight multiplication tables.
The error in that argument was that they are looking at numbers that aint a prime. For instance 23*29 = 667 and 667 is not counted in those eight multiplication tables. But it is not a prime.
My theory or axiom (whatever I am not a scientist) is that if you have a ten digit prime, all you need to do is check with those eight primes to verify if your ten digit prime is a prime.
I am uncertain of this, and it needs to be discussed.
Arguments for it is that those eight primes multiplication tables do not cover no other primes, and the product of two primes above 19.
If this can be varified or if it is set aside as a foul idea is yet to be discovered. If it is verified to bruteforce primes will be easier since you take x/y were x is the unknowned prime, and y is one of the eight primes established.
As we all know primes can only be devided with one and itself. But instead of using a bruteforce that calculate each and every digit there is, my hypthesis provides us with only eight numbers to verify the unknowned prime.
I am willing to take critics towards this method, and I am not certain that my method works...
I have had this discussion before, were those who argued against me said that i was wrong because if you multply primes above 19 with eachother you will have a number that isn't fit in to those eight multiplication tables.
The error in that argument was that they are looking at numbers that aint a prime. For instance 23*29 = 667 and 667 is not counted in those eight multiplication tables. But it is not a prime.
My theory or axiom (whatever I am not a scientist) is that if you have a ten digit prime, all you need to do is check with those eight primes to verify if your ten digit prime is a prime.
I am uncertain of this, and it needs to be discussed.
Arguments for it is that those eight primes multiplication tables do not cover no other primes, and the product of two primes above 19.
If this can be varified or if it is set aside as a foul idea is yet to be discovered. If it is verified to bruteforce primes will be easier since you take x/y were x is the unknowned prime, and y is one of the eight primes established.
As we all know primes can only be devided with one and itself. But instead of using a bruteforce that calculate each and every digit there is, my hypthesis provides us with only eight numbers to verify the unknowned prime.
I am willing to take critics towards this method, and I am not certain that my method works...