Sophie Germain prime p and the permutation of product of first p cycles

AbstractFor a natural number n, the permutation (n!) is defined as the left-to-right product of the first n cycles, namely, . In this article, we prove that for any natural number n, 2 is a primitive root of 2n + 1 if and only if 2n + 1 = pk for some odd prime number p and for some natural number k such that the permutation (n!) has exactly k orbits. We also prove that a prime number p is a Sophie Germain prime if and only if the permutation (p!) has at most two orbits.Mathematics Subject Classification (2020): Primary: 20B30Secondary: 11A41Key words: Primitive rootSophie Germain primepermutationorbits of permutation