A prime $p = 2a^2 – 2ab + 3b^2$ for integers $a$ and $b$, then $p$ cannot be congruent to $11 \pmod{20}$. 
A prime $p = 2a^2 – 2ab + 3b^2$ for integers $a$ and $b$, then $p$ cannot be congruent to $11 \pmod{20}$.

I need to prove the conclusion and I tried by constructing a contradiction:
First, I suppose $$p \equiv 11 \pmod{20}$$ and factorized the prime as $$(a+3b)(a-b)$$
So I get two possible cases:

*

*$(a+3b)\equiv 1 \pmod{20}$ and $(a-b) \equiv 11 \pmod{20}$


*$(a+3b)\equiv 11\pmod{20}$ and $(a-b) \equiv 1 \pmod{20}$
However I do not know how to deal with it.
Is this a right direction or there are other good methods to prove the statement? Looking forward to any suggestions!

Well, initially I didn't see that your factorization was wrong, so I have written the answer according to the cases you got in the end. This is how you would do If the factorization was correct.
Just subtract the two equations you got to get $$4b \equiv \pm 10 \pmod{20}$$ which means $4b\pm 10$ is divisible by $20$, but this is not possible since $20$ is of the form $4k$.
