Question 1207739
<font color=black size=3>
See this similar question before moving on
<a href="https://www.algebra.com/algebra/homework/divisibility/Divisibility_and_Prime_Numbers.faq.question.1207682.html">https://www.algebra.com/algebra/homework/divisibility/Divisibility_and_Prime_Numbers.faq.question.1207682.html</a>
I'll use the ideas discussed in that link.


phi(n) = Euler's Totient function
phi(205) = phi(5*41)
phi(205) = phi(5)*phi(41)
phi(205) = (5-1)*(41-1)
phi(205) = 160
There are 160 integers in the set {1,2,3,...,203,204} such that they are relatively prime to 205.


The goal of solving 
x^2 = 11 (mod 205)
will have us needing to solve
2u = 1 (mod 160)
which turns into
2u-1 = 160k
and then can be arranged into
2(u-80k) = 1


The left hand side is always even, but the right hand side is odd.
This mismatch proves 2u-1 = 160k has no integer solutions
This means 2u = 1 (mod 160) doesn't have any solutions either.
Ultimately x^2 = 11 (mod 205) <font color=red>doesn't have any solutions</font>.


You can use spreadsheet software or a coding script like python to verify.
</font>