Question

$\forall n\ /\ \not\exists$ {primitive roots modulo n}: if $\ Max(ord_n(k))+1 \mid n\ $ then $\ Max(ord_n(k))+1\ $ is prime?

score 249 · Answer 1 · 2015-05-21 08:53:56

249

Views

$\forall n\ /\ \not\exists$ {primitive roots modulo n}: if $\ Max(ord_n(k))+1 \mid n\ $ then $\ Max(ord_n(k))+1\ $ is prime?

Published on 21 May 2015 - 8:53

score 766 · Answer 2 · 2015-06-12 04:05:30

766

Views

Non existence of absolute euler pseudoprimes

Published on 12 Jun 2015 - 4:05

score 935 · Answer 3 · 2015-07-22 16:34:23

935

Views

Can a Carmichael number be even?

Published on 22 Jul 2015 - 16:34

score 146 · Answer 4 · 2015-07-22 17:04:38

146

Views

In the definition of Carmichael number, why is it necessary to have $(b, n) = 1$?

Published on 22 Jul 2015 - 17:04

score 184 · Answer 5 · 2015-09-15 15:57:32

184

Views

Composite numbers $n$, such that every $a$ with $1<a<n-1$ is a witness

Published on 15 Sep 2015 - 15:57

score 135 · Answer 6 · 2015-09-17 18:20:45

135

Views

A composite odd number, not being a power of $3$, is a fermat-pseudoprime to some base

Published on 17 Sep 2015 - 18:20

score 289 · Answer 7 · 2015-09-19 17:03:15

289

Views

Which odd composite numbers $n$ are strong-pseudoprime to no base $a$ with $1<a<n-1$?

Published on 19 Sep 2015 - 17:03

score 148 · Answer 8 · 2015-10-04 17:27:04

148

Views

Question related to pseudoprimes and Carmichael numbers

Published on 04 Oct 2015 - 17:27

score 305 · Answer 9 · 2026-03-18 23:46:53

305

Views

pseudo-primality and test of Solovay-Strassen

Published on 18 Mar 2026 - 23:46

score 310 · Answer 10 · 2015-10-24 15:32:56

310

Views

Is a number $n$ known, which is not squarefree, but a strong fermat-pseudoprime to base $2$ and $3$?

Published on 24 Oct 2015 - 15:32

score 559 · Answer 11 · 2015-10-27 21:46:44

559

Views

Efficient method to find the strong pseudoprimes to base $2,3,5$ upto $10^9$

Published on 27 Oct 2015 - 21:46

score 817 · Answer 12 · 2015-10-28 18:41:55

817

Views

Constructing a number strong probable prime to several bases

Published on 28 Oct 2015 - 18:41

score 44 · Answer 13 · 2015-10-31 20:29:21

44

Views

For which $k$ do we get a Carmichael-number?

Published on 31 Oct 2015 - 20:29

score 123 · Answer 14 · 2026-03-24 15:40:19

123

Views

Carmichael number $p \times ... \times q$ , such there are at most $20$ primes in the range $[p,q]$

Published on 24 Mar 2026 - 15:40

score 199 · Answer 15 · 2026-03-21 21:51:56

199

Views

Is it known whether the possible number of prime factors of a Carmichael-number is bounded?

Published on 21 Mar 2026 - 21:51

List Question

$\forall n\ /\ \not\exists$ {primitive roots modulo n}: if $\ Max(ord_n(k))+1 \mid n\ $ then $\ Max(ord_n(k))+1\ $ is prime?

Non existence of absolute euler pseudoprimes

Can a Carmichael number be even?

In the definition of Carmichael number, why is it necessary to have $(b, n) = 1$?

Composite numbers $n$, such that every $a$ with $1<a<n-1$ is a witness

A composite odd number, not being a power of $3$, is a fermat-pseudoprime to some base

Which odd composite numbers $n$ are strong-pseudoprime to no base $a$ with $1<a<n-1$?

Question related to pseudoprimes and Carmichael numbers

pseudo-primality and test of Solovay-Strassen

Is a number $n$ known, which is not squarefree, but a strong fermat-pseudoprime to base $2$ and $3$?

Efficient method to find the strong pseudoprimes to base $2,3,5$ upto $10^9$

Constructing a number strong probable prime to several bases

For which $k$ do we get a Carmichael-number?

Carmichael number $p \times ... \times q$ , such there are at most $20$ primes in the range $[p,q]$

Is it known whether the possible number of prime factors of a Carmichael-number is bounded?

Trending Questions

Popular # Hahtags

Popular Questions