It looks like you're using an Ad Blocker.
Please white-list or disable AboveTopSecret.com in your ad-blocking tool.
Thank you.
Some features of ATS will be disabled while you continue to use an ad-blocker.
Maybe I wasn’t joking - maybe I was on to something after all?
I have established a formula which I confidently believe to be able to deduce whether or not a given number is prime or composite. This is unheard of,
mathematicians have been looking for such a thing for centuries. I’m not making it public here and now because, first and foremost, I need to ensure
that I take the credit for it. I am trying to get in contact with a reputable mathematics society in order to verify my claim. In any case, I do
invite people to discuss known theories and other related matters in respect of prime numbers.
I will, however, show you this...
The number 599 is, of course, a prime. 5+9+9 = 23
By using that method I have discovered, at least so far as 1-1000 is concerned, that no prime number will ever be equal to a multiple of 3 (that is
with the exception of 3 itself). For instance, 543 is equal to 12 and therefore cannot be a prime number based on the above law because it is
divisible by 3 (yes, 543 goes into 3 but that’s not what I mean, I’m only looking at adding those numbers together). While this test is not
entirely useful it should prove that a given number is a composite if 3 is a divisor, and therefore can be used as a first-pass check (especially with
large numbers). This isn’t my actual algorithm but it kind of shows what I’m getting at.
I know I talk up some proper guff sometimes but so far as my own tests are concerned, my theory looks very strong. If it truly does work then I’m
talking about a Noble Prize here.
originally posted by: VigiliaProcuratio
Maybe I wasn’t joking - maybe I was on to something after all?
I have established a formula which I confidently believe to be able to deduce whether or not a given number is prime or composite. This is unheard of, mathematicians have been looking for such a thing for centuries. I’m not making it public here and now because, first and foremost, I need to ensure that I take the credit for it. I am trying to get in contact with a reputable mathematics society in order to verify my claim. In any case, I do invite people to discuss known theories and other related matters in respect of prime numbers.
I will, however, show you this...
The number 599 is, of course, a prime. 5+9+9 = 23
By using that method I have discovered, at least so far as 1-1000 is concerned, that no prime number will ever be equal to a multiple of 3 (that is with the exception of 3 itself). For instance, 543 is equal to 12 and therefore cannot be a prime number based on the above law because it is divisible by 3 (yes, 543 goes into 3 but that’s not what I mean, I’m only looking at adding those numbers together). While this test is not entirely useful it should prove that a given number is a composite if 3 is a divisor, and therefore can be used as a first-pass check (especially with large numbers). This isn’t my actual algorithm but it kind of shows what I’m getting at.
I know I talk up some proper guff sometimes but so far as my own tests are concerned, my theory looks very strong. If it truly does work then I’m talking about a Noble Prize here.
originally posted by: VigiliaProcuratio
a reply to: dashen
Oh, believe me now... I had one of the worst headaches ever yesterday and that is no joke! I’m unsure if it was all those numbers or the fact that I had 503 cups of coffee while I was working at it.
Trivial numbers are irrelevant, what matters are the ones you couldn’t print on this page without causing both the server and your computer to crash. Did you know that the highest known prime number has almost 17.5 million digits? If my theory is true then I will suppose it can be used to smash that record. Anyway, the entire point of having a formula is that it can be tested against any number and will be able to categorically confirm whether it is a prime or composite - it doesn’t matter if we already know what the answer is, what counts is that the formula will be correct every time. If it does hold then it can quite possibly have huge applications in science and industry, particularly where reliable predictions have to be made.
That’s just a another example, it is NOT the algorithm of concern. I picked up on it and found it was rather interesting because if you have a number with lots and lots and lots of digits then you can try adding them all together to see if they add up to anything which can be divided by 3 (in other words, if it adds up to 24 then it’s not a prime because it goes into 3).
originally posted by: VigiliaProcuratio
a reply to: HighDesertPatriot
Oh right, maybe next time I’ll have an even amount of cups to be on the safe-side!
a reply to: theantediluvian
Well, maybe there are already working formulas in existence and they haven’t been made public because they are used for not only encryption, but also things like creating the lightest yet strongest armour possible. Dunno really.
a reply to: TheLamb
Trivial numbers are irrelevant, what matters are the ones you couldn’t print on this page without causing both the server and your computer to crash. Did you know that the highest known prime number has almost 17.5 million digits? If my theory is true then I will suppose it can be used to smash that record. Anyway, the entire point of having a formula is that it can be tested against any number and will be able to categorically confirm whether it is a prime or composite - it doesn’t matter if we already know what the answer is, what counts is that the formula will be correct every time. If it does hold then it can quite possibly have huge applications in science and industry, particularly where reliable predictions have to be made.
originally posted by: theantediluvian
If I'm understanding correctly, you're summing the digits and then testing for divisibility by 3. This is a well known shortcut for determining if a number is divisible by 3. Obviously any number > 3 that is divisible by 3 isn't a prime.
See Wikipedia - Divisibility Rule.
originally posted by: VigiliaProcuratio
Basically guys... I’ll challenge anybody to show me a working formula which can deduce with 100% accuracy that a given number is prime. My formula can do it.
originally posted by: VigiliaProcuratio
Wait, hold on... I don’t understand this modular stuff. I know that’s a well-known formula as I saw it on my travels while working out my own theory... but I can’t grasp how it works. Can you explain it?
In number theory, a formula for primes is a formula generating the prime numbers, exactly and without exception. No such formula which is efficiently computable is known. A number of constraints are known, showing what such a "formula" can and cannot be.