Search results
Jump to navigation
Jump to search
Page title matches
- 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
- 12 bytes (1 word) - 13:20, 6 December 2007
- ...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
- 112 bytes (16 words) - 07:11, 4 September 2009
- 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
- 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
- {{r|Euler pseudoprime||***}}395 bytes (45 words) - 07:44, 11 November 2009
- Auto-populated based on [[Special:WhatLinksHere/Euler pseudoprime]]. Needs checking by a human.529 bytes (67 words) - 16:25, 11 January 2010
- 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
- {{r|Euler pseudoprime}}459 bytes (58 words) - 20:40, 11 January 2010
- {{r|Euler pseudoprime}}459 bytes (58 words) - 16:32, 11 January 2010
- |rowspan="2" |[[Euler pseudoprime]] |21 ||Euler pseudoprime ||8, 132 KB (296 words) - 23:58, 20 February 2010
- {{r|Euler pseudoprime}}757 bytes (104 words) - 16:32, 20 June 2009
- Most of the pseudoprimes, like [[Euler pseudoprime]]s, [[Carmichael number]]s, [[Fibonacci pseudoprime]]s and [[Lucas pseudopr2 KB (267 words) - 07:56, 15 June 2009
- ...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
- {{r|Euler pseudoprime}}260 bytes (35 words) - 17:07, 26 July 2008
- ...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
- *Every absolute [[Euler pseudoprime]] is a Carmichael number.4 KB (576 words) - 12:00, 1 January 2013