Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Yes if multiplicative order of $q$ modulo $n$$p^r$ equals to $\phi(p^r) = (p-1)p^{r-1}$$(p-1)p^{r-1}$.
Yes if multiplicative order of $q$ modulo $n$ equals to $\phi(p^r) = (p-1)p^{r-1}$.
Yes if multiplicative order of $q$ modulo $p^r$ equals to $(p-1)p^{r-1}$.
