Prime number/Citable Version: Revision history

13 September 2013

• curprev 12:2012:20, 13 September 2013‎ imported>John Stephenson‎ m 14,251 bytes +14,251‎ moved Prime number to Prime number/Citable Version: citable version policy

13 January 2008

• curprev 23:1823:18, 13 January 2008‎ imported>D. Matt Innis‎ 14,251 bytes −39‎ No edit summary

12 August 2007

• curprev 13:4413:44, 12 August 2007‎ imported>Aleksander Stos‎ 14,290 bytes +14,290‎ approved version 1.2, text copied from /Draft page

10 May 2007

• curprev 21:4621:46, 10 May 2007‎ imported>D. Matt Innis‎ m 14,150 bytes +768‎ sp
• curprev 19:1919:19, 10 May 2007‎ imported>D. Matt Innis‎ 14,150 bytes +768‎ update to v1.1

6 May 2007

• curprev 20:1320:13, 6 May 2007‎ imported>David Tribe‎ m 13,382 bytes +80‎ Protected "Prime number": Protecting approved V1 D Tribe [edit=sysop:move=sysop]
• curprev 20:1120:11, 6 May 2007‎ imported>David Tribe‎ 13,382 bytes +80‎ tagging approved D Tribe reverting post approval edit in process
• curprev 17:5717:57, 6 May 2007‎ imported>Michael Hardy‎ 13,302 bytes +1,051‎ →‎There are infinitely many primes: deleted nonsense. I'm surprised to find such a comment in an article that someone called "ready for approval".
• curprev 04:3304:33, 6 May 2007‎ imported>Greg Martin‎ 13,331 bytes +11‎ →‎There are infinitely many primes: restate last paragraph

5 May 2007

• curprev 18:2818:28, 5 May 2007‎ imported>Catherine Woodgold‎ 13,320 bytes +1,104‎ math tags
• curprev 13:3613:36, 5 May 2007‎ imported>Catherine Woodgold‎ 13,248 bytes +11‎ →‎There are infinitely many primes: inserting "the number" before N - 1
• curprev 00:1600:16, 5 May 2007‎ imported>Greg Martin‎ 13,237 bytes +734‎ →‎There are infinitely many primes: medium-thorough rewrite
• curprev 00:0500:05, 5 May 2007‎ imported>Greg Martin‎ m 12,503 bytes +66‎ →‎Locating primes: minor rewording of first paragraph
• curprev 00:0200:02, 5 May 2007‎ imported>Greg Martin‎ 12,501 bytes +64‎ linked to unique factorization; rewrote "this"s; minor editing/formatting

4 May 2007

• curprev 08:4708:47, 4 May 2007‎ imported>Greg Woodhouse‎ 12,437 bytes +221‎ characterization => way of saying this
• curprev 05:3305:33, 4 May 2007‎ imported>Jitse Niesen‎ 12,435 bytes −4‎ revert my last edit - 2^n+1 factors if n has an odd divisor, so all primes of the form 2^n+1 are in fact of the form 2^(2^n)+1
• curprev 05:2505:25, 4 May 2007‎ imported>Jitse Niesen‎ 12,439 bytes +4‎ →‎Primes of special forms: fix definition of Fermat number
• curprev 05:2005:20, 4 May 2007‎ imported>Jitse Niesen‎ m 12,435 bytes +219‎ spelling

3 May 2007

• curprev 21:4921:49, 3 May 2007‎ imported>Greg Woodhouse‎ 12,439 bytes +223‎ unique factorization property
• curprev 20:1720:17, 3 May 2007‎ imported>Catherine Woodgold‎ 12,216 bytes 0‎ unique set of prime factors. (The way it's written is not unique.)