Search results
Jump to navigation
Jump to search
Page title matches
- A '''pseudoprime''' is a composite number that has certain properties in common with [[prime !align="center"|Property !!kind of pseudoprime2 KB (296 words) - 23:58, 20 February 2010
- 145 bytes (21 words) - 11:15, 4 September 2009
- 12 bytes (1 word) - 18:51, 28 January 2008
- A '''strong pseudoprime''' is an [[Euler pseudoprime]] with a special property: ...ot 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
- 253 bytes (31 words) - 07:56, 26 January 2010
- 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
- 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 ...ath>\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>\scrip2 KB (267 words) - 07:56, 15 June 2009
- 12 bytes (1 word) - 13:19, 6 December 2007
- 12 bytes (1 word) - 13:20, 6 December 2007
- ...eart of all calculating fermat pseudoprime-, euler pseudoprime- and strong pseudoprime programs:1 KB (175 words) - 05:14, 6 January 2008
- A Fermat pseudoprime to at most 1/2 of all possible bases less than itself.112 bytes (16 words) - 07:11, 4 September 2009
- ...eart of all calculating fermat pseudoprime-, euler pseudoprime- and strong pseudoprime programs:3 KB (325 words) - 05:10, 6 January 2008
- 91 bytes (11 words) - 19:50, 4 September 2009
- 253 bytes (31 words) - 10:29, 9 November 2009
- 253 bytes (31 words) - 10:33, 9 November 2009
- 12 bytes (1 word) - 23:10, 9 February 2008
- 195 bytes (32 words) - 17:02, 6 June 2009
- Auto-populated based on [[Special:WhatLinksHere/Pseudoprime]]. Needs checking by a human. {{r|Strong pseudoprime}}474 bytes (61 words) - 19:48, 11 January 2010
- Auto-populated based on [[Special:WhatLinksHere/Euler pseudoprime]]. Needs checking by a human. {{r|Fermat pseudoprime}}529 bytes (67 words) - 16:25, 11 January 2010
- Auto-populated based on [[Special:WhatLinksHere/Fermat pseudoprime]]. Needs checking by a human. {{r|Euler pseudoprime}}459 bytes (58 words) - 16:32, 11 January 2010
Page text matches
- {{r|Pseudoprime||**}} {{r|Strong pseudoprime||***}}395 bytes (45 words) - 07:44, 11 November 2009
- 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
- A '''strong pseudoprime''' is an [[Euler pseudoprime]] with a special property: ...ot 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
- Auto-populated based on [[Special:WhatLinksHere/Euler pseudoprime]]. Needs checking by a human. {{r|Fermat pseudoprime}}529 bytes (67 words) - 16:25, 11 January 2010
- Auto-populated based on [[Special:WhatLinksHere/Strong pseudoprime]]. Needs checking by a human. {{r|Euler pseudoprime}}459 bytes (58 words) - 20:40, 11 January 2010
- Auto-populated based on [[Special:WhatLinksHere/Fermat pseudoprime]]. Needs checking by a human. {{r|Euler pseudoprime}}459 bytes (58 words) - 16:32, 11 January 2010
- 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 ...ath>\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>\scrip2 KB (267 words) - 07:56, 15 June 2009
- A '''pseudoprime''' is a composite number that has certain properties in common with [[prime !align="center"|Property !!kind of pseudoprime2 KB (296 words) - 23:58, 20 February 2010
- A Fermat pseudoprime to at most 1/2 of all possible bases less than itself.112 bytes (16 words) - 07:11, 4 September 2009
- Auto-populated based on [[Special:WhatLinksHere/Pseudoprime]]. Needs checking by a human. {{r|Strong pseudoprime}}474 bytes (61 words) - 19:48, 11 January 2010
- ...eart 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
- {{r|Pseudoprime}}225 bytes (28 words) - 13:16, 14 June 2008
- ...eart of all calculating fermat pseudoprime-, euler pseudoprime- and strong pseudoprime programs:3 KB (325 words) - 05:10, 6 January 2008
- {{r|Pseudoprime}}430 bytes (55 words) - 19:27, 11 January 2010
- {{r|Euler pseudoprime}}757 bytes (104 words) - 16:32, 20 June 2009
- ...e and lead to [[Fibonacci pseudoprime|Fibonacci pseudoprimes]] and [[Lucas pseudoprime|Lucas pseudoprimes]], respectively.4 KB (776 words) - 20:44, 20 February 2010
- *Every absolute [[Euler pseudoprime]] is a Carmichael number.4 KB (576 words) - 12:00, 1 January 2013
- * [[Strong pseudoprime]]21 KB (2,958 words) - 05:06, 8 March 2024
- * [[Pseudoprime]]25 KB (3,396 words) - 13:29, 2 April 2024