20080820, 21:38  #12  
Aug 2002
Ann Arbor, MI
1B1_{16} Posts 
Quote:


20080821, 03:33  #13  
"Richard B. Woods"
Aug 2002
Wisconsin USA
1E0C_{16} Posts 
Quote:
Quote:
Quote:
Quote:
Quote:
And if you're requiring that all posts achieve some ideal of precision even outside of mathematics, then for consistency you need to disqualify a whole bunch (pardon the imprecision) of your own words. Quote:
Quote:
Quote:
Quote:
Last fiddled with by cheesehead on 20080821 at 03:51 

20080821, 10:58  #14 
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17×251 Posts 
This warning should be put on every one of RD Silverman's posts...because any time he posts, it's just to insult someone who might not know as much as him or used improper language or something, to which somebody nicer tries to defend the insultee. The topic is always forgotten after RD Silverman posts, largely because he ignores it and starts a flame war based on something stupid. 
20080822, 01:02  #15  
Nov 2003
2^{2}×5×373 Posts 
Quote:
I am about to pour gas on the fire. I don't think that you are a moron. I think that you are an idiot trying to become a moron. I case you did not notice (and clearly you did not), I was DEFENDING someone who the O.P. called a moron. You clearly can not read. 

20080822, 02:19  #16  
Nov 2006
Singapore
3×5^{2} Posts 
Quote:


20080822, 02:44  #17  
Nov 2003
7460_{10} Posts 
Quote:
there are infinitely many primes in (some) A.P.'s. Most (sufficiently) fastgrowing sequence will contain finitely many primes. It is known that (with suitable definition of measure) almost all sequences A_1, A_2, A_3, ... for which sum(1/log(A_i)) converges contain finitely many primes (almost all means Lebesgue measure 1 among the uncountable set of all such sequences; It is only the uncountability of the sequences that makes this proof at all tricky.) Constructing a sequence of integers that grows faster than linear that contains infinitely many primes is NOT a trivial problem. We do have proofs for some. For example, there exists a positive real number theta such that floor(theta^3^n) is prime i.o. I know of no equivalent proof that the almost all sequences for which the above sum diverges contains infinitely many primes. (I don't even know if it has been considered; I just gave myself a research problem; but the proof MAY turn out to be simple) While it is virtually certain that the sequence (a^n 1)/(a1) for n=2,3,5,... contains infinitely primes for positive appropriate values of a (e.g. non powers) , we have no proof. Most FASTER GROWING sequences will not contain infinitely many. 

20080822, 03:02  #18  
Nov 2003
2^{2}·5·373 Posts 
Quote:
If one wants to discuss mathematics, then either use proper language or don't post. Failure to use proper language shows that either you have not done proper backgound preparation or else lack the ability to discuss the problem intelligently. In both cases you should not post! I have been told repeatedly that this is not a classroom and that I am not here to teach. If this is NOT a classroom, then it becomes a (purported) discussion among peers. In that case flames are appropriate for poorly posed questions or for posts that clearly show inadequate ability/knowledge/preparation for intelligent discussion. I propose we separate the math subforum into two groups: (1) A discussion of mathematics at the undergrad or higher level, with a requirement that anyone initiating a thread has thoroughly mastered high school level math (basically precalculus). I would also assume sufficient mathematical maturity to present problems that make sense. I would also presume that anyone posing a question involving math not ordinarily seen in high school such as abstract algebra, number theory, etc. has, AT A MINUMUM at least read a book on the subject and worked some of the problems. This is basically a subforum for the mathematically competent. It can even be refereed. It is the equivalent of sci.math.research, except at a lower level. (2) Questions, ideas, conjectures and general nonsense posed by newbies, and those less knowledgeable. This would include those who can not rigorously formulate their questions. I fully promise not to even reply to this subgroup. It is the equivalent of 'alt.algebra.help' However, if newbies want to play with the big boys, they need to show that they have earned the right to do so by showing that they have at least read the literature before posing any questions, and that they have formulated their problem using standard mathematical notation and terminology. There is a discussion currently in sci.math in which others (not I) have made the statement: "You have not earned the right to take up (or waste) my time" in reply to a post. John Baez created a score card for measuring cranks in general. Some of his rules are quite relevant here. I will propose some additional scores herein. (1) 10 points for trying to discuss any subject for which you have not taken a course, or read at least one book. (2) 15 points for not using standard mathematical terminology. (3) 15 points for failing to define your variables and their domain. (4) 20 points for trying to generate a discussion instead of asking a question when it is clear that you do not understand what you are trying to discuss. (5) 25 points for failing to do a web or literature search before posing an idea or question. (6) 35 points for elementary mistakes in high school level mathematics. (7) 50 points for trying to invent new mathematical terminology. (8) 50 points for trying to "reinvent the wheel". An extra 10 points for reinventing a "square wheel" (e.g. a 'new' algorithm that performs more poorly than existing ones) (9) 50 points for posing poorly defined problems, or for posing problems which show a lack of BASIC understanding of elementary aspects of the subject you are trying to discuss. (10) 100 points for both trying to invent new terminology and failing at the same time to rigorously define what that terminology really means. (11) 200 points for even trying to pose a solution to a wellstudied problem in which you are not an expert. (12) 500 points for trying to claim that knowledge of the stateoftheart "gets in the way" of creativity. (13) 1000 points for any comparison of yourself to any well known mathematician, or for trying to point out that some prior mathematican worked in some area in which he/she was not trained as if this were an excuse for your doing the same.  Note that there is a difference between asking "is the following solution correct", and asserting that you have a solution. I, in turn, will promise not to flame ANYONE unless their crank score exceeds 25 (including both my scores and those of John Baez). If you want to discuss math at the undergrad level or higher, you must earn the right to do so by demonstrating that you have the background to do so intelligently. Otherwise, you WILL get flamed. Above all, this means that any questions presented need to be rigorous in their meaning. 

20080822, 03:14  #19  
Nov 2006
Singapore
3·5^{2} Posts 
Quote:
Strange that someone who demands precision uses terms such as "most(sufficiently)fastgrowing" , "Most FASTER GROWING" and "virtually certain" to name a few. Last fiddled with by Visu on 20080822 at 03:15 

20080822, 03:25  #20  
"Richard B. Woods"
Aug 2002
Wisconsin USA
2^{2}·3·641 Posts 
Quote:
Quote:
Quote:
Last fiddled with by cheesehead on 20080822 at 03:28 

20080822, 03:41  #21  
Nov 2006
Singapore
1001011_{2} Posts 
Quote:


20080822, 04:49  #22 
Cranksta Rap Ayatollah
Jul 2003
281_{16} Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Is CEMPLLA 1.5 "the only software in the world capable of discovering" something? Not really.  CRGreathouse  Number Theory Discussion Group  51  20181216 21:55 
AouessareEl HaddouchiEssaaidi "test": "if Mp has no factor, it is prime!"  wildrabbitt  Miscellaneous Math  11  20150306 08:17 
Palindrome primes (a.k.a. Elementary S03E03 "Just a Regular Irregular")  Batalov  And now for something completely different  12  20141116 19:03 
PrimeRelated History: Leibniz' "Universal Language Based on Primes"  ewmayer  Math  10  20070302 12:47 
Would Minimizing "iterations between results file" may reveal "is not prime" earlier?  nitai1999  Software  7  20040826 18:12 