Search results

Page title matches

• Euler pseudoprime
  A composite number ''n'' is called an '''Euler pseudoprime''' to a natural base ''a'' if <math>\scriptstyle a^{\frac {n-1}{2}} \equiv *Every Euler pseudoprime is odd.
  1 KB (188 words) - 21:54, 19 February 2010
• Talk:Euler pseudoprime
  12 bytes (1 word) - 13:17, 6 December 2007
• Template:Euler pseudoprime/Metadata
  | pagename = Euler pseudoprime | abc = Euler pseudoprime
  941 bytes (102 words) - 12:45, 6 December 2007
• Euler pseudoprime/Approval
  12 bytes (1 word) - 13:20, 6 December 2007
• Euler pseudoprime/Code
  ...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
• Euler pseudoprime/Definition
  112 bytes (16 words) - 07:11, 4 September 2009
• Euler pseudoprime/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Euler pseudoprime]]. Needs checking by a human.
  529 bytes (67 words) - 16:25, 11 January 2010

Page text matches

• Euler pseudoprime
  A composite number ''n'' is called an '''Euler pseudoprime''' to a natural base ''a'' if <math>\scriptstyle a^{\frac {n-1}{2}} \equiv *Every Euler pseudoprime is odd.
  1 KB (188 words) - 21:54, 19 February 2010
• Natural number/Catalogs/Special properties
  {{r|Euler pseudoprime||***}}
  395 bytes (45 words) - 07:44, 11 November 2009
• Euler pseudoprime/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Euler pseudoprime]]. Needs checking by a human.
  529 bytes (67 words) - 16:25, 11 January 2010
• Strong pseudoprime
  A '''strong pseudoprime''' is an [[Euler pseudoprime]] with a special property: *Every strong pseudoprime is also an Euler pseudoprime.
  1 KB (203 words) - 07:58, 15 June 2009
• Talk:Carmichael number
  I'm not sure why it's asserted that every CN is an [[Euler pseudoprime]]. 2821 is a counterexample base 2, since 2^2821 == 1520 mod 2821, but 282 :So 2821 is a Carmichael number, and it is an euler pseudoprime too. Not to every base, but to many bases. --[[User:Karsten Meyer|Karsten M
  637 bytes (74 words) - 18:50, 8 November 2008
• Template:Euler pseudoprime/Metadata
  | pagename = Euler pseudoprime | abc = Euler pseudoprime
  941 bytes (102 words) - 12:45, 6 December 2007
• Strong pseudoprime/Related Articles
  {{r|Euler pseudoprime}}
  459 bytes (58 words) - 20:40, 11 January 2010
• Fermat pseudoprime/Related Articles
  {{r|Euler pseudoprime}}
  459 bytes (58 words) - 16:32, 11 January 2010
• Pseudoprime
  |rowspan="2" |[[Euler pseudoprime]] |21 ||Euler pseudoprime ||8, 13
  2 KB (296 words) - 23:58, 20 February 2010
• User:Karsten Meyer/Zahlentheorie
  ...ermat pseudoprime|fermatschen Primzahlen]] (fermatsche Pseudoprimzahlen, [[Euler pseudoprime|eulerschen Pseudoprimzahlen]], Euler-Jacobi-Pseudoprimzahlen, [[strong pseu
  1 KB (178 words) - 04:11, 22 November 2023
• Leonhard Euler/Related Articles
  {{r|Euler pseudoprime}}
  757 bytes (104 words) - 16:32, 20 June 2009
• Fermat pseudoprime
  Most of the pseudoprimes, like [[Euler pseudoprime]]s, [[Carmichael number]]s, [[Fibonacci pseudoprime]]s and [[Lucas pseudopr
  2 KB (267 words) - 07:56, 15 June 2009
• Fermat pseudoprime/Code
  ...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
• Carmichael number/Related Articles
  {{r|Euler pseudoprime}}
  260 bytes (35 words) - 17:07, 26 July 2008
• Euler pseudoprime/Code
  ...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
• Carmichael number
  *Every absolute [[Euler pseudoprime]] is a Carmichael number.
  4 KB (576 words) - 12:00, 1 January 2013
• User:Karsten Meyer
  {{pl|Euler pseudoprime}} -
  16 KB (2,756 words) - 14:20, 8 March 2024
• User:Chris Day/sandbox1
  *[[Euler pseudoprime]]
  12 KB (1,160 words) - 21:33, 2 April 2024
• Talk:Prime number/Draft
  *Prime numbers and Pseudoprimes ([[Fermat pseudoprime]], [[Euler pseudoprime]], [[Carmichael number]], ...)
  36 KB (6,274 words) - 16:22, 27 November 2008
• User:Karsten Meyer/Table of the fermat Pseudoprimes
  ...like in "33: '''10''', '''23'''" then is the numer of the first column an euler pseudoprime to the base too. Example: 33 is an euler pseudoprime to the bases 10 and 23. 33 is also an euler pseudoprime to every base <math>33n+10</math> and <math>33n+23</math> with <math>n \ge
  528 KB (67,464 words) - 04:11, 22 November 2023