20041022, 18:19  #1 
Aug 2004
2×3×7 Posts 
Bob, I'm calling you out!
Bob (you know who you are),
I posted this on the other forum you frequent, but in case you don't catch it, her it is again. I challenge you to find one inconsistency or one illdefined phrase in my post EFFICIENCY: PRIME TEST vs PRIME GENERATOR or my CLARIFICATION post. In case you don't like the WAY I defined my generator, I'll even redefine it here for you: Let p(n) be the nth prime Let p(n)# be p(n)*p(n1)*p(n2)*...*5*3*2 Let abs() be absolute value Let +/ be "plus or minus", though the theory works with just minus Let q(x1,x2,x3,...xn):positive integers > positive integers given by q(x1,x2,x3,...xn)= abs( A +/ B) where A and B are given by: p(n)# divides A*B p(n+r) doesn't divide A*B for all r in the positive integers gcd(A,B)=1 each xi is the positive integer exponent on each p(i) Then if q(x1,x2,x3,...xn) < [p(n+1)]^2, then q(x1,x2,x3,...xn)is prime. This is because contradiction of the distributive principle shows that q(x1,x2,x3,...xn) will not have any of p(1), p(2),... p(n) as factors, and the square root of q(x1,x2,x3,...xn) is less than p(n+1). Now, is that welldefined enough? As I said before, to get all primes < [p(n+1)]^2, it's important to use ALL POSSIBLE disjoint partitions of {p(1),....,p(n)} into the two sets to be put into A and B. This will produce primes without testing any composites, because the elimination of those composites is intrinsic to the definition of A and B, the gcd(A,B)=1, and the "less than" test. This indicates that this algorithm may still be in the running as the most efficient way to find primes, given that it doesn't waste time testing a large number of BIG composites. Prove me wrong, if you dare! 
20041022, 18:39  #2 
Banned
"Luigi"
Aug 2002
Team Italia
2×7^{4} Posts 
I have a question: How can you prove primality of p(n+1)?
And how can you prove that p(n+r) doesn't divide A*B for all r in the positive integers (as it seems to be implicit in your demonstration)? Luigi Last fiddled with by ET_ on 20041022 at 18:42 
20041022, 20:59  #3  
"William"
May 2003
New Haven
4471_{8} Posts 
Quote:
I haven't followed closely, but if I recall correctly, Bob's comments on your work have fallen into two categories. One category was that you haven't yet learned the fundamentals of measuring complexity. The other is that you seem to be unaware of related published work. I don't see any indication that you have addressed either of these issues. Famous people are inundated with nonsense from cranks. If you want a slice of their time, you need to clearly distinguish yourself from those cranks. "Calling him out" isn't a very effective strategy for improving your positioning. 

20041022, 22:37  #4  
Aug 2004
2^{2}×5 Posts 
Quote:
Like: You said this, but this is wrong because of ....whatever. Instead, he is talking in a condescending tone of voice about go and read this, and you are too ignorant, etc. Just like he would say: I know you will walk into my trap. I know what is wrong, but I am not going to tell you, because I want to teach you a lesson! And the lesson is that you are not allowed to have ideas, unless you have studied as much as I did and followed all my instructions.... I am sure BOB is a very knowledgable and smart man, but he thinks we are dumb students and he is the teacher. This is wrong. This here is a platform where people with the same interest get together. Everybody is on a different level, and we teach each other or learn from each other. BOB would be right if he would reprimand a student for not studying, because he is wasting the time and money of the university, but he can't do the same to people who come here with original or not so original ideas. There is a nice way of telling someone why is he wrong. Nobody likes to be treated like dirt. Just my 2 cents. 

20041023, 01:57  #5 
Aug 2004
2·3·7 Posts 
Okay, maybe it was a little over the top, but it was meant a little humorously, and like amateur said (thank you), he makes unsupported claims that my posts are "rediculous" and "not well defined". I just want him to support his claims, or quit making them. I'm here both to learn and to share, and I can see a place for positive criticism in that, but not outright aggression. If he supports his claims, then I will see them as being positive criticism, and thank him for his comments. Maybe I don't (yet) have a ph.d., but there is a certain amount of respect that should go both ways, and I feel it hasn't been.
ET, Second question first. You create A and B that way. Take an example. Starting with {2,3,5,7,11} you put some in A, some in B. So A might be 2^a*5^b*7^c, and B would have to be 3^d*11^e in order to use all of them from the set. So A*B has all of the above primes as factors, and no others i.e. no prime p(n+r) divides A*B. First question: Let's look at this inductively. Using {2,3} i.e. abs(2^a +/ 3^b) you can get all primes from 5 to 25. Then you use the primes you just found, {2,3,5,7,11,13,17,19} and 23, but we won't use 23, I'll explain in a minute why. Put some of the set in A, ALL OF THE REST in B, and apply the absolute value thingie. Now, here is where the 23 comes in. EVERY output less than 23^2=529 will be prime. These will all be between 23 and 529. Next step? Use the primes you just found, except 523, to find all primes between 523 and 523^2=273529. Granted, we're getting a huge number of variables, but it's exciting that the range grows so fast, and no composites need checking. Don't know if it is efficient, but smart algorithms could be created to pick partitions between A and B that are most likely to give small enough outputs to be within the target range without too much trouble. Even if it isn't efficient, it should be worth something as a theoretical understanding of one more facet of the distribution of the primes. Aaron 
20041023, 02:13  #6 
Aug 2004
52_{8} Posts 
I just read a posting by Bob on another website, wherein he explains why my theory is "rediculous". Basically, the number of computations, even if we can ensure optimal partitioning, are truly astronomical. So it isn't efficient. But it's still interesting! Thank you for your positive criticism. I truly apologize for getting "huffy". I didn't  couldn't know why you were so against me, until you said. Now I know you really did have a reason. I also apologize if I offended anyone else. Aaron 
20041023, 11:28  #7  
Banned
"Luigi"
Aug 2002
Team Italia
2·7^{4} Posts 
Quote:
It seems you are working on two different fields of factoring: congruences modulo a prime numbers product and trial factoring up to the square root of a number. A hint: take a look at the Fermat's little theorem and check out results to avoid Carmichael numbers. You will have a good challenge to check the efficience of your idea. Luigi 

20041025, 11:36  #8  
Nov 2003
16444_{8} Posts 
Quote:
I told synergy in the very beginning that his/her scheme was unworkable because it required too much computation. I would call that a concrete response. I suggested to you and synergy that you spend some time learning the basics of this subject. This suggestion was ignored. I suggested to synergy that he/she count the number of required operations. This suggestion was ignored. It is possible to cure ignorance by studying. It is impossible to cure willful and arrogant ignorance. You and synergy better learn this, or you will have a very hard time in school. Synergy suggested, in a sci.math post that (2^x 3^y  5^w 7^z) was prime if it was less than 121 because it is not divisible by 2,3,5,7. I asked synergy to demonstrate how to determine x,y,w,z so that N = (2^x 3^y  5^w 7^z) for a given N < 121. This request was ignored. I asked synergy if he could demonstrate that every prime p < 121 was in fact in the range of this exponential expression. This too was ignored. Synergy proposed that if p = A  B or A + B, where A and B were taken as the product of primes less than some bound, and if p were bounded, then p was prime. I agreed with this. But I pointed out that this was handwaving, not an algorithm, because it failed to specify a method for constructing A and B. Indeed, synergy even failed to show that every p HAD such a representation. Now, in later posts, synergy suggests finding A & B by searching all the possible subsets. I suspected this is what he had in mind originally. If synergy had bothered to do even the minimal amount of background research, he would have discovered what I told him in the first place: It requires too much arithmetic. Yet, synergy continued to cling to his idea that because his "method" did not involve checking composites, that it would be faster than existing methods. I also suggested that synergy look at the SIZE of A and B and estimate the amount of arithmetic needed to calculate them. This too was ignored. Let S(n) = {p < n  p prime} and let S = S1 + S2. To prove p prime, we must find A = product(p in S1) and B = product(p in S2) such that p = A+B, or p = AB and p < square of the largest element of S. This does indeed give a method for proving p prime. However, we have not proved that every prime p has such a representation. Furthermore there are 2^n such subsets to be examined. And the arithmetic to compute A and B is extensive. We have #S(n) ~ n/log n by the PNT. max(A, B) is approximately exp(n). Thus, the arithmetic to find a represention in the desired form is O(2^(n/log n) exp(n)). This is DOUBLY exponential in the size of the problem. You and synergy are typical of cranks. You refuse to take suggestions, you refuse to learn the background information needed to discuss the subject, and you are not even aware of the *extent* of how much you don't know. I hope you don't have this attitude with your other teachers. I quote from above: "BOB would be right if he would reprimand a student for not studying" This is exactly what you and synergy HAVE done. You refused to do your studying. I even told you what should be studied. You can't discuss a subject until you know the basics. 

20041025, 14:26  #9 
Aug 2004
2^{2}·5 Posts 
Thank you Bob for your reply.
There are a few misunderstandings I would like to clear up. I have no teachers, it has been a few decades since I finished school, and I have no formal education in mathematics. Just plain high school math and what I have picked up here and there, because I am interested in this subject. I guess, this would be enough for someone to stop taking me seriously, and calling me a crank /English Slang Dictionary: "a mentally deranged person"/ Well, my mental derangement (insanity) has been good enough for obtaining Mensa membership. It is no big deal, but they are not famous for having mentally handicapped members.... Yes, I do lack the necessary knowledge. I wish I had it, because then I wouldn't have to ask for help, I could work out things for myself. Math is my hobby. I like trying to find solutions for difficult problems, and I refuse to feel bad about it. Also, I don't mind making a fool of myself, because that is part of the process. I have a few ideas that might be new and interesting, and if so, I would like to share it with other people. That's why I am looking for someone who could tell me if the ideas I have are new or old, and in case they are useful, how could they be improved? I don't intend to continue studying at my age, but I don't think that I should be silenced just because I am not an expert. I had this idea on how to make a filter for primes. It is similar to Eratosthenes' Sieve, but different.... I haven't seen it anywhere, and it is slow, but I think it has potential. It could be streamlined to make it more efficient. Even so, it should be of interest for someone who is into this subject. Because I am a layperson, it has been written and explained in plain English, but so far everybody was able to understand the method. I know that you are a very busy person, but it would be an honour if you would agree to take a look at it. Maybe when you see my idea you will change your mind about me. It is not earthshattering, not perfect, not even fast enough to revolutionize the search for primes, but I hope you will see the uniqueness of it. I have posted it on my webpage. If you agree I will send you the URL. amateur p.s. sorry for my mistakes, English is my second language. 
20041025, 15:00  #10 
Aug 2004
2^{2}·5 Posts 
As far as synergy's idea is concerned, my knowledge is limited to make an opinion. I just pointed out that someone who is trying to come up with original ideas should not be called a crank, and an idea that doesn't work because it has a flaw is not a gibberish, but an idea that has a flaw
Edison: "If I find 10,000 ways something won't work, I haven't failed. I am not discouraged, because every wrong attempt discarded is often a step forward...." 
20041025, 16:25  #11  
Nov 2003
1D24_{16} Posts 
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Calling airsquirrels  Prime95  GPU Computing  16  20150929 18:06 
Calling all 64bit Linux sievers!  frmky  NFS@Home  25  20131016 15:58 
Calling a spade a "spade"  davieddy  Soap Box  5  20090123 05:17 
Calling hotshot coders: NFS code challenge  R.D. Silverman  Programming  63  20061009 05:48 