Hi all, I had a problem, pls help me.

Let $\displaystyle b_1 < b_2 < \cdots < b_{\varphi(m)}$ be the integers between 1 andmthat are relatively prime tom(including 1), of course, $\displaystyle \varphi(m)$ is the number of integers between 1 andmthat are relatively prime tom, and let $\displaystyle B = b_1b_2b_3{\cdots}b_{\varphi(m)}$ be their product.

Please find a pattern for when $\displaystyle B\equiv1 ({\bmod}\ m)$ and when $\displaystyle B\equiv-1 ({\bmod}\ m)$.

Thanks and Regards.