Question

How do I show that this number is a pseudo prime?

score 250 · Answer 1 · 2026-04-29 12:51:31

250

Views

How do I show that this number is a pseudo prime?

Published on 29 Apr 2026 - 12:51

score 587 · Answer 2 · 2026-05-07 04:18:49

587

Views

Do $n=2m+1$ and $\big(2^m\bmod(m\cdot n)\big)\in\{n+1,3n-1\}$ imply $n$ prime?

Published on 07 May 2026 - 4:18

score 167 · Answer 3 · 2026-04-22 22:35:06

167

Views

if $d$ divides $n$, why is $d^{n-1} \not\equiv 1 \pmod n$?

Published on 22 Apr 2026 - 22:35

score 68 · Answer 4 · 2026-04-22 15:02:06

68

Views

Could be Euler product for Riemann zeta function runs over pseudo-prime?

Published on 22 Apr 2026 - 15:02

score 443 · Answer 5 · 2026-05-07 08:10:27

443

Views

Show that all Fermat numbers pass the base $2$ test (pseudoprime).

Published on 07 May 2026 - 8:10

score 161 · Answer 6 · 2026-04-29 12:52:14

161

Views

Is this the best primality test using second order recurrences (Lucas Sequences)?

Published on 29 Apr 2026 - 12:52

score 68 · Answer 7 · 2026-04-22 21:24:47

68

Views

If n = $\frac{a^{2p}-1}{a^2-1}$ where $a$ is an integer $>1$ and $p$ is an odd prime, then $n$ is pseudoprime to the base $a$.

Published on 22 Apr 2026 - 21:24

score 472 · Answer 8 · 2026-05-05 06:09:04

472

Views

Lucas Sequence and primality tests. is this test deterministic?

Published on 05 May 2026 - 6:09

score 132 · Answer 9 · 2026-04-26 15:34:34

132

Views

Passing k rounds of the Miller Rabin probabilistic test

Published on 26 Apr 2026 - 15:34

score 179 · Answer 10 · 2026-04-22 16:55:39

179

Views

Show that $3281$ is a strong pseudoprime to base $3$

Published on 22 Apr 2026 - 16:55

score 1.2k · Answer 11 · 2026-04-23 23:58:05

1.2k

Views

What's the difference between a Fermat pseudoprime and a Carmichael number?

Published on 23 Apr 2026 - 23:58

score 63 · Answer 12 · 2026-04-29 08:58:48

63

Views

Is this proof for pseudo primes suitable?

Published on 29 Apr 2026 - 8:58

score 123 · Answer 13 · 2026-04-28 11:30:43

123

Views

Finding Large Pseudoprimes with a Computer

Published on 28 Apr 2026 - 11:30

score 59 · Answer 14 · 2026-04-28 16:41:48

59

Views

Conjecture about congruences arising from a special semiprime

Published on 28 Apr 2026 - 16:41

score 170 · Answer 15 · 2026-05-07 02:37:22

170

Views

Was the number $3,317,044,064,679,887,385,961,981$ doublechecked?

Published on 07 May 2026 - 2:37

List Question

How do I show that this number is a pseudo prime?

Do $n=2m+1$ and $\big(2^m\bmod(m\cdot n)\big)\in\{n+1,3n-1\}$ imply $n$ prime?

if $d$ divides $n$, why is $d^{n-1} \not\equiv 1 \pmod n$?

Could be Euler product for Riemann zeta function runs over pseudo-prime?

Show that all Fermat numbers pass the base $2$ test (pseudoprime).

Is this the best primality test using second order recurrences (Lucas Sequences)?

If n = $\frac{a^{2p}-1}{a^2-1}$ where $a$ is an integer $>1$ and $p$ is an odd prime, then $n$ is pseudoprime to the base $a$.

Lucas Sequence and primality tests. is this test deterministic?

Passing k rounds of the Miller Rabin probabilistic test

Show that $3281$ is a strong pseudoprime to base $3$

What's the difference between a Fermat pseudoprime and a Carmichael number?

Is this proof for pseudo primes suitable?

Finding Large Pseudoprimes with a Computer

Conjecture about congruences arising from a special semiprime

Was the number $3,317,044,064,679,887,385,961,981$ doublechecked?

Trending Questions

Popular # Hahtags

Popular Questions