Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ ¹ ² ³ °
 

You are not logged in. #1 20140209 20:14:24
need help in simple computation for my thoryI'm new here, and I wouldnt be here if I wasn't looking for a help in checking my theory. #2 20140209 20:23:41
Re: need help in simple computation for my thorySounds interesting: http://bluebox.com.pl/klienci/howtocrypt.pdf 'And fun? If maths is fun, then getting a tooth extraction is fun. A viral infection is fun. Rabies shots are fun.' 'God exists because Mathematics is consistent, and the devil exists because we cannot prove it' 'Who are you to judge everything?' Alokananda #3 20140209 20:42:03
Re: need help in simple computation for my thorythanks man for pasting link. Im posting this everywhere I can, but Im not a math guy, so I dont know where I schould send this, and this is how I google your topic about primes, and registered account #4 20140209 21:23:08
Re: need help in simple computation for my thoryHi; In mathematics, you don't understand things. You just get used to them. I have the result, but I do not yet know how to get it. All physicists, and a good many quite respectable mathematicians are contemptuous about proof. #5 20140209 21:34:22
Re: need help in simple computation for my thoryadding. Last edited by martnSpruce (20140209 21:35:28) #6 20140209 21:45:57
Re: need help in simple computation for my thoryI think what you are describing is called a Sieve of Eratosthenes. In mathematics, you don't understand things. You just get used to them. I have the result, but I do not yet know how to get it. All physicists, and a good many quite respectable mathematicians are contemptuous about proof. #7 20140209 21:57:48
Re: need help in simple computation for my thoryit's irrelevant I think. its about to prove that primes are not in random places, and find the rule (and reason why they are so important) for all primes, which allow us to predictate the 'noise' pattern or maybe each new prime. Last edited by martnSpruce (20140209 21:59:31) #8 20140209 21:58:33
Re: need help in simple computation for my thoryI do not think it is irrelevant. You are doing it. In mathematics, you don't understand things. You just get used to them. I have the result, but I do not yet know how to get it. All physicists, and a good many quite respectable mathematicians are contemptuous about proof. #9 20140209 22:13:42
Re: need help in simple computation for my thoryyea, it's easiest I could find to search for them using script. I described script I've wroted to search not the theory. Theory is not about how to find prime. #10 20140209 22:16:04
Re: need help in simple computation for my thoryHi;
I believe that 1 is not a prime because it is defined that way.
I am afraid no one knows whether that is true or not. In mathematics, you don't understand things. You just get used to them. I have the result, but I do not yet know how to get it. All physicists, and a good many quite respectable mathematicians are contemptuous about proof. #11 20140209 22:28:27
Re: need help in simple computation for my thoryI understand, that's why Im posting it, to look for a help. If this wave theory could be correct next step is to create formula that is creating primes, because there would be a rule how primes are born. #12 20140209 22:34:07
Re: need help in simple computation for my thoryThis problem has been bothering mankind for more than 23 centuries. There is no such simple formula. I could send you to the page but suffice it to say there is none that is computationally feasible. In other words it does not exist.
I believe it is the Sieve of Eratosthenes in disguise so of course it is correct. But that will still not allow you to predict where the primes will fall. In mathematics, you don't understand things. You just get used to them. I have the result, but I do not yet know how to get it. All physicists, and a good many quite respectable mathematicians are contemptuous about proof. #13 20140209 22:47:59
Re: need help in simple computation for my thory
Hehe yea, you are right. But it works perfectly for the first few primes, and my theory is defined  primes are like waves appearing in every new frequency hole, also genetaring his own. All that anyone else can do is to prove it wrong. Last edited by martnSpruce (20140209 22:48:36) #14 20140209 22:54:09
Re: need help in simple computation for my thory
Your method is an algorithm. An algorithm is not a formula. An algorithm is a method or recipe. A formula is a direct relationship between variables. Your method of waves is already known as far as I can see.
There are other methods besides your "waves" or Sieve of Eratosthenes. One of them is trial division. It too will generate all the primes. But for the purposes of computation it is useless because it takes too long even with the fastest machines. The sieve ( your method ) is also computationally infeasible ( it takes too long ). In mathematics, you don't understand things. You just get used to them. I have the result, but I do not yet know how to get it. All physicists, and a good many quite respectable mathematicians are contemptuous about proof. #15 20140209 23:40:34
Re: need help in simple computation for my thoryPrime computation is just side effect. According to this theory primes are just freqiencies where impulses are. Last edited by martnSpruce (20140209 23:42:06) #16 20140209 23:46:48
Re: need help in simple computation for my thory
This is not correct. You have only proven that the multiples of primes act as waves as you call them. Nothing can be said about the primes themselves from your method.
I do not know about being better at math but I have checked it. There will always be a prime at a hole as you call it. There is nothing mysterious or deep about that. It was known to the ancient Greeks 2000 years before we were both born. It is called the Sieve of Eratosthenes. In mathematics, you don't understand things. You just get used to them. I have the result, but I do not yet know how to get it. All physicists, and a good many quite respectable mathematicians are contemptuous about proof. #17 20140210 00:13:03
Re: need help in simple computation for my thoryOK. You're welcome to our community. Hope to hear some more from you 'And fun? If maths is fun, then getting a tooth extraction is fun. A viral infection is fun. Rabies shots are fun.' 'God exists because Mathematics is consistent, and the devil exists because we cannot prove it' 'Who are you to judge everything?' Alokananda #18 20140210 01:44:33
Re: need help in simple computation for my thory
It looks like it works great in reversing. which is valuable in decyption of current cryptography. Also if you know how it works you can easily optimize sieve or (I hope) in future find a formula. Last edited by martnSpruce (20140210 01:49:37) #19 20140210 03:12:46
Re: need help in simple computation for my thory
If you do, you will certainly miss some primes.
Euclid proved long ago that there is no last prime. Of course there are primes with 100 billion digits. In mathematics, you don't understand things. You just get used to them. I have the result, but I do not yet know how to get it. All physicists, and a good many quite respectable mathematicians are contemptuous about proof. #20 20140210 04:16:10
Re: need help in simple computation for my thory
The point is  you wont. I did computation.
Like I said above you can predict how many primes you need to find first with 100billion numbers (decimal). I didnt said anything about last prime. #21 20140210 04:20:53
Re: need help in simple computation for my thoryI am afraid that is incorrect. If you do not sieve out every prime all the multiples will remain. Half is not good enough. Large primes count too, why do you think the do not? In mathematics, you don't understand things. You just get used to them. I have the result, but I do not yet know how to get it. All physicists, and a good many quite respectable mathematicians are contemptuous about proof. #22 20140210 04:39:52
Re: need help in simple computation for my thoryWe probably missunderstood each other. While you are checking if 997 is a prime, you just have to check if there is no interfere with primes in 2500 range. Second half is irrelevant. #23 20140210 04:42:41
Re: need help in simple computation for my thoryYou are still talking about tiny numbers that trial division would work on. In mathematics, you don't understand things. You just get used to them. I have the result, but I do not yet know how to get it. All physicists, and a good many quite respectable mathematicians are contemptuous about proof. #24 20140210 04:53:49
Re: need help in simple computation for my thoryBecause numbers are irrelevant. To find if X is prime you need to know all primes in range 2(X/2) #25 20140210 04:56:40
Re: need help in simple computation for my thoryAnd how on earth with your method can you get all the primes from In mathematics, you don't understand things. You just get used to them. I have the result, but I do not yet know how to get it. All physicists, and a good many quite respectable mathematicians are contemptuous about proof. 