Finally.... done!

Well, in order to finish this mission, I think we have to know how "modulo" works. My mistake when coding the program is with the modulo stuff.

Hmm, modulo. Simple explanation about modulo is this :

If a statement

a congruent b modulo m is given to us,

it means that

a = nm + b, where

n is a "random" value we don't know.

For example, in the mutant_r_us_guild's article,

8 wrapped by a modulo of 5 would be 3.

In this case: a = 8, m = 5, and b = 3;

Because a = nm + b --> so 8 = 5n + c;

In this case, we got the n = 1.

For another example, also in mutant_r_us_guild's article

26 wrapped by a modulo of 5 would be 1,

In this case a = 26, m = 5, and b = 1.

because a = nm + b, so

26 = 5n + 1 --> 5n = 25 --> n = 5;

We got the n here equal with 5.

Now, in this mission, we don't know what n value and a value is, but we got the b. Fortunately, b value and m value is enough to search for a and n. For the m value, like what mutant_r_us_guild said in his article, we must search for it ourself (Actually, it's "hidden" here somewhere in this thread. Just search for mutant_r_us_guild's post one by one, and you'll get the m).

But after we get that m value, it's not too hard to search for a and n. Let me give one last example :

Let's assume that b = 3; m = 7;

a = nm + b --> a = 7n + 3;

In order to get the a value, let's just brute-force the n.

If n = 1 then a = 10,

if n = 2, then a = 17,

If n = 3, then a = 24

and so on.

So, what is the relation of this modulo, the

a value,

n value, and another values with this mission? I won't explain about that, I'm afraid you'll be more confused

. Just read the

mutant_r_us_guild's article for information about that.