# Square Congruence

Number Theory Level pending

Let K and N be two Natural Numbers such that $$\frac{N}{K}$$is not an integer. Then find the smallest value for K such that $$N^2 \equiv 2 \pmod{K}$$holds for some $$N > K.$$

×