Search results

Page title matches

• Prime Number
  #Redirect [[Prime number]]
  26 bytes (3 words) - 16:11, 14 June 2008
• Prime number
  ...orm a full rectangle more than one square wide with 11 squares, so 11 is a prime number.]] A '''prime number''' is a [[integer|whole number]] greater than 1 that can be evenly divided
  18 KB (2,917 words) - 10:27, 30 August 2014
• Prime number theorem
  #Redirect [[Prime Number Theorem]]
  34 bytes (4 words) - 16:00, 20 May 2008
• Prime number/Definition
  133 bytes (20 words) - 05:24, 8 July 2008
• Prime Number Theorem
  ...nly 23% of the two-digit numbers and 16% of the three-digit numbers. The [[Prime number#Locating primes|trial division method]] provides an intuitive explanation. ...the [[natural logarithm]] of <math>n</math>). The formal statement of the Prime Number Theorem is
  4 KB (703 words) - 12:02, 13 November 2007
• Prime number/Approval
  Creating [[Prime number/Draft]] [[User:David Tribe|David Tribe]] 20:04, 6 May 2007 (CDT)
  6 KB (905 words) - 23:27, 13 January 2008
• Prime number/Bibliography
  949 bytes (118 words) - 12:40, 15 January 2008
• Prime number/External Links
  12 bytes (1 word) - 12:41, 15 January 2008
• Prime number/Related Articles
  {{r|Prime Number Theorem}}
  225 bytes (28 words) - 13:16, 14 June 2008
• Prime number/Citable Version
  ...orm a full rectangle more than one square wide with 11 squares, so 11 is a prime number.]] ...and itself. The first few prime numbers are 2, 3, 5, 7, 11, 13, and 17. A prime number <math>p</math> cannot be factored as the [[multiplication|product]] of two
  14 KB (2,281 words) - 12:20, 13 September 2013
• Prime Number Theorem/Definition
  137 bytes (22 words) - 10:56, 13 November 2008
• Prime Number Theorem/Approval
  12 bytes (1 word) - 12:02, 13 November 2007
• Prime Number Theorem/Related Articles
  854 bytes (137 words) - 02:29, 12 November 2008

Page text matches

• Natural number/Catalogs/Special properties
  {{r|Prime number}}
  395 bytes (45 words) - 07:44, 11 November 2009
• Sophie Germain prime/Definition
  Any prime number p such that 2p + 1 is also prime.
  87 bytes (13 words) - 19:31, 4 September 2009
• Sophie Germain prime
  If <math>p\ </math> is a prime number and <math>2\cdot p + 1</math> is a prime number too, then we call <math>p\ </math> a '''Sophie Germain prime'''. The Sophie
  277 bytes (42 words) - 15:41, 23 February 2009
• Prime (disambiguation)
  {{rpl|Prime number}}
  76 bytes (10 words) - 04:30, 24 September 2013
• Prime number/Related Articles
  {{r|Prime Number Theorem}}
  225 bytes (28 words) - 13:16, 14 June 2008
• Riemann zeta function/Definition
  ...portant in [[number theory]] for its connection with the distribution of [[prime number]]s.
  219 bytes (27 words) - 16:59, 13 November 2008
• Prime (mathematics)
  #REDIRECT [[Prime number]]
  26 bytes (3 words) - 21:24, 19 April 2010
• Prime Numbers
  #Redirect [[Prime number]]
  26 bytes (3 words) - 16:10, 14 June 2008
• Prime Number
  #Redirect [[Prime number]]
  26 bytes (3 words) - 16:11, 14 June 2008
• Prime numbers
  #Redirect [[Prime number]]
  26 bytes (3 words) - 20:21, 1 April 2008
• Number/Related Articles
  {{r|Prime number}}
  258 bytes (33 words) - 02:29, 8 February 2009
• Prime number theorem
  #Redirect [[Prime Number Theorem]]
  34 bytes (4 words) - 16:00, 20 May 2008
• Carmichael number/Bibliography
  * [[Paulo Ribenboim]]. The New Book of Prime Number Records. Springer-Verlag, 1996, ISBN 0-387-94457-5
  253 bytes (31 words) - 07:51, 15 June 2009
• Fermat pseudoprime/Bibliography
  * [[Paulo Ribenboim]]: The New Book of Prime Number Records. Springer-Verlag, 1996, ISBN 0-387-94457-5
  253 bytes (31 words) - 10:29, 9 November 2009
• Strong pseudoprime/Bibliography
  * [[Paulo Ribenboim]]. The New Book of Prime Number Records. Springer-Verlag, 1996, ISBN 0-387-94457-5
  253 bytes (31 words) - 10:33, 9 November 2009
• Pseudoprime/Bibliography
  * [[Paulo Ribenboim]]. The New Book of Prime Number Records. Springer-Verlag, 1996, ISBN 0-387-94457-5
  253 bytes (31 words) - 07:56, 26 January 2010
• Greatest common divisor/Tutorials
  ...or of two integers involves [[Unique factorization|factoring]] both into [[prime number]]s: Observe that the prime number 2 occurs twice in the factorization of 60, and three times in the factoriza
  4 KB (570 words) - 18:05, 1 July 2009
• Unique factorization/Related Articles
  {{r|Prime Number Theorem}} {{r|Prime number}}
  574 bytes (75 words) - 21:21, 11 January 2010
• Euclid's lemma
  ...meter and number theorist [[Euclid]] of [[Alexandria]], states that if a [[prime number]] ''p'' is a [[divisor]] of the [[multiplication|product]] of two [[integer
  2 KB (322 words) - 12:51, 18 December 2007
• Pseudoprime
  ...rime''' is a composite number that has certain properties in common with [[prime number]]s. ...can test it for properties that all prime numbers share. One property of a prime number is that it is only divisible by one and itself. This is a defining property
  2 KB (296 words) - 23:58, 20 February 2010