Search results

...hoice of approved version is being carried at her explicit direction. In [[Prime number]], there was a last minute problem with a single phrase that made it into t

...rime Number Theorem]], not being a proper name, will need to be moved to [[Prime number theorem]]. There are lots of little things like these that are pointed out ...d that there is no clear guidance on the subject. (As it happens, I think Prime Number Theorem is a name, but I'm probably old-fashioned). [[User:Richard Pinch|R

...enotes a method that does not use [[complex analysis]]. For example, the [[prime number theorem]] was first proven in 1896, but an elementary proof was found only The following are examples of problems in analytic number theory: the [[prime number theorem]], the [[Goldbach conjecture]] (or the [[twin prime conjecture]], o

: It says "A prime number is a number that can be evenly divided by exactly two positive whole number ...licit? It seems much clearer to me, a number theorist even, if you say "a prime number is a positive whole number that can be evenly divided by exactly two positi

...2, although for the fast evaluation <math>N</math> should not have large [[prime number|prime factor]]s.

...ust proved about something else), even if it isn't the same theorem as the Prime Number Theorem. Mentioning "the Fundamental Theorem of Arithmetic" makes it clear

*<math>\mathbb{P}</math>, the set of [[prime number|prime numbers]]

This page contains discussions archived from [[Talk:Prime number/Draft]]. :* The aside on notation. I think the definition of prime number without symbols works perfectly fine, making me wonder why you praise the v

#[[Prime number/Citable Version]]

*[[Complex number]] underwent an emergency copyedit, and [[Prime number]] was approved in a 1.1 version. ...orm a full rectangle more than one square wide with 11 squares, so 11 is a prime number.}}

...a for the sum of a [[geometric series]] to write the product as..."'' at [[prime number]].) It feels good to have one of one's suggestions taken up, and the wordi ...a reality check, take f(n) = qn+a to be linear, and then we arrive at the prime number theorem for arithmetic progressions which is of course known. - [[User:Greg

...a for the sum of a [[geometric series]] to write the product as..."'' at [[prime number]].) It feels good to have one of one's suggestions taken up, and the wordi ...a reality check, take f(n) = qn+a to be linear, and then we arrive at the prime number theorem for arithmetic progressions which is of course known. - [[User:Greg

* [[Prime number]]

...ied suggesting a few ideas, but until my articles [[Complex number]] and [[Prime number]] were approved yesterday, I've pretty much had my hands full. I had intend

...e concept of an "elementary proof" (as in, say, an elementary proof of the prime number theorem) - but an elementary proof may be more difficult to understand (for ...y complex analysis has ever actually read Selberg and Erdos's proof of the prime number theorem, for example. (Of course, I have no way of showing that.)

...omments here as I have on the discussion pages of [[Complex number]] and [[Prime number]], since the article might be reworked soon; but the spirit of my comments

* {{cite book | title=The new book of prime number records | author=Paulo Ribenboim | authorlink=Paulo Ribenboim | publisher=[

; Prime number multiples ...in any row where the second term is a [[prime number]] are multiple of the prime number. For instance, if a row starts with <math>\scriptstyle 1, 23, 253, \cdots <

{{rpl|Prime number}}

...I think) defined 'divides' formally-- they say "divides evenly" on various prime number pages, which may be good for readers who had math teachers who used those w