Modularistics!

Number Theory Level pending

We usually find the remainder of \(a^x\) when divided by some integers with \(a\) for some integers and \(x\) for some natural numbers. IA would be mad if I don't share this problem.

Find the minimum value of \(x, x\in \mathbb{N}\) which satisfies the mod equations below!

\[60^{x} \equiv 0 (\mod{10368})\]

×

Problem Loading...

Note Loading...

Set Loading...