Hi, also need help with this one, been trying this for hours..
Find all integers that are k>=3 (bigger or equal to 3)
a) 11 ≡ k^2, mod k
b) 7 ≡ k, mod k^2
try to see the meaning of the congruence
since k is already an integer >= 3 , and n must be an integer. the only way n could be integer is if is also an integer. there is only one value of
k for which this happens........
apply similar reasoning to b)