Give a number n, find the minimum x(x>0) that satisfies 2^x mod n = 1.
One positive integer on each line, the value of n.
If the minimum x exists, print a line with 2^x mod n = 1.
Print 2^? mod n = 1 otherwise.
You should replace x and n with specific numbers.
1 | 2 |
1 | 2^? mod 2 = 1 |
This is a loop problem, you need to loop x from 1 to MAX to find if there is an x that fits it. However, if the $2^{MAX}$ can be very big and exceeded long long. So we use an formula
$$
(a \times b)%n = ((a % n) \times b) % n
$$
which means $2^i = (2^i ) % n$ in this situation.
1 |
|