Hi!

I am very new at this modulo arithmetic, and donīt know who to interpret this problem.

Let N = 2*3*5*7*........*101 + 1

Find the smallest positive integer for which $\displaystyle N \equiv x\ (\bmod y)$

if y = 2.

Please help me UNDERSTAND what to do here, not just a solution.

Thanks!