Search results

Page title matches

• Fermat pseudoprime
  A composite number <math>\scriptstyle q\ </math> is called a '''Fermat pseudoprime''' to a natural base <math>\scriptstyle a\ </math>, which is coprime to <ma ...base <math>\scriptstyle a\ </math> then <math>\scriptstyle q\ </math> is a Fermat pseudoprime to base <math>\scriptstyle b\cdot q+a</math> for every integer <math>\scrip
  2 KB (267 words) - 07:56, 15 June 2009
• Fermat pseudoprime/Approval
  12 bytes (1 word) - 13:19, 6 December 2007
• Fermat pseudoprime/Code
  The following Sourcecode is the Heart of all calculating fermat pseudoprime-, euler pseudoprime- and strong pseudoprime programs:
  1 KB (175 words) - 05:14, 6 January 2008
• Fermat pseudoprime/Definition
  195 bytes (32 words) - 17:02, 6 June 2009
• Fermat pseudoprime/Bibliography
  253 bytes (31 words) - 10:29, 9 November 2009
• Fermat pseudoprime/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Fermat pseudoprime]]. Needs checking by a human.
  459 bytes (58 words) - 16:32, 11 January 2010

Page text matches

• Natural number/Catalogs/Special properties
  {{r|Fermat pseudoprime||***}}
  395 bytes (45 words) - 07:44, 11 November 2009
• Fermat pseudoprime
  A composite number <math>\scriptstyle q\ </math> is called a '''Fermat pseudoprime''' to a natural base <math>\scriptstyle a\ </math>, which is coprime to <ma ...base <math>\scriptstyle a\ </math> then <math>\scriptstyle q\ </math> is a Fermat pseudoprime to base <math>\scriptstyle b\cdot q+a</math> for every integer <math>\scrip
  2 KB (267 words) - 07:56, 15 June 2009
• Euler pseudoprime/Definition
  A Fermat pseudoprime to at most 1/2 of all possible bases less than itself.
  112 bytes (16 words) - 07:11, 4 September 2009
• Euler pseudoprime/Related Articles
  {{r|Fermat pseudoprime}}
  529 bytes (67 words) - 16:25, 11 January 2010
• Euler pseudoprime
  *Every Euler pseudoprime is also a [[Fermat pseudoprime]]:
  1 KB (188 words) - 21:54, 19 February 2010
• Fermat pseudoprime/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Fermat pseudoprime]]. Needs checking by a human.
  459 bytes (58 words) - 16:32, 11 January 2010
• Pseudoprime
  |<math>a^{n-1} \equiv 1 \pmod{n}</math> ||[[Fermat pseudoprime]] |15 ||Fermat pseudoprime ||4, 11
  2 KB (296 words) - 23:58, 20 February 2010
• Fermat pseudoprime/Code
  The following Sourcecode is the Heart of all calculating fermat pseudoprime-, euler pseudoprime- and strong pseudoprime programs:
  1 KB (175 words) - 05:14, 6 January 2008
• Euler pseudoprime/Code
  The following Sourcecode is the Heart of all calculating fermat pseudoprime-, euler pseudoprime- and strong pseudoprime programs:
  3 KB (325 words) - 05:10, 6 January 2008