Search results
Jump to navigation
Jump to search
Page title matches
- A '''strong pseudoprime''' is an [[Euler pseudoprime]] with a special property: ...= d\cdot 2^s + 1</math> (where <math>\scriptstyle d\ </math> is odd) is a strong pseudoprime to a base <math>\scriptstyle a\ </math> if:1 KB (203 words) - 07:58, 15 June 2009
- 12 bytes (1 word) - 23:10, 9 February 2008
- 91 bytes (11 words) - 19:50, 4 September 2009
- 253 bytes (31 words) - 10:33, 9 November 2009
- Auto-populated based on [[Special:WhatLinksHere/Strong pseudoprime]]. Needs checking by a human.459 bytes (58 words) - 20:40, 11 January 2010
Page text matches
- {{r|Strong pseudoprime||***}}395 bytes (45 words) - 07:44, 11 November 2009
- A '''strong pseudoprime''' is an [[Euler pseudoprime]] with a special property: ...= d\cdot 2^s + 1</math> (where <math>\scriptstyle d\ </math> is odd) is a strong pseudoprime to a base <math>\scriptstyle a\ </math> if:1 KB (203 words) - 07:58, 15 June 2009
- *[[strong pseudoprime|Strong pseudoprimes]] are Euler pseudoprimes too.1 KB (188 words) - 21:54, 19 February 2010
- {{r|Strong pseudoprime}}529 bytes (67 words) - 16:25, 11 January 2010
- Auto-populated based on [[Special:WhatLinksHere/Strong pseudoprime]]. Needs checking by a human.459 bytes (58 words) - 20:40, 11 January 2010
- |rowspan="2" |[[strong pseudoprime]] |49 ||strong pseudoprime ||18, 19, 30, 312 KB (296 words) - 23:58, 20 February 2010
- {{r|Strong pseudoprime}}474 bytes (61 words) - 19:48, 11 January 2010
- ...s the Heart of all calculating fermat pseudoprime-, euler pseudoprime- and strong pseudoprime programs:1 KB (175 words) - 05:14, 6 January 2008
- ...s the Heart of all calculating fermat pseudoprime-, euler pseudoprime- and strong pseudoprime programs:3 KB (325 words) - 05:10, 6 January 2008
- * [[Strong pseudoprime]]21 KB (2,958 words) - 05:06, 8 March 2024