For each of the following congruences, find all integers N, with N>1, that make the congruence true. 10equiv5(mod N).

Concept used:
$x\equiv y(modn)$ if and only if x and y differ by a multiple of n.
The given congruence is,
$10\equiv 5(modN)$.
The difference of the given congruence integers is calculated as,
$x-y=10-5=5$
The factors of 10 for N > 1 is 5 , so the integers for the given congruences is 5.
Thus, the integers for the given congruences is 5.