- #1

- 12

- 0

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

Let [tex]b_1 < b_2 < \cdots < b_{\varphi(m)}[/tex] be the integers between 1 and m that are relatively prime to m (including 1), of course, [tex]\varphi(m)[/tex] is the number of integers between 1 and

Please find a pattern for when [tex]B\equiv1 ({\bmod}\ m)[/tex] and when [tex]B\equiv-1 ({\bmod}\ m)[/tex].

Thanks and Regards.

Let [tex]b_1 < b_2 < \cdots < b_{\varphi(m)}[/tex] be the integers between 1 and m that are relatively prime to m (including 1), of course, [tex]\varphi(m)[/tex] is the number of integers between 1 and

*m*that are relatively prime to*m*, and let [tex]B = b_1b_2b_3{\cdots}b_{\varphi(m)}[/tex] be their product.Please find a pattern for when [tex]B\equiv1 ({\bmod}\ m)[/tex] and when [tex]B\equiv-1 ({\bmod}\ m)[/tex].

Thanks and Regards.

Last edited: