Is there any method to solve for integer solution of a quadratic equation like following:
$$ax^2 + bx + c = 0$$ where $a, b, c \in \mathbb{Z}$
If not is it possible for the Special case: ?
$$x^2 -x + c = 0$$ where $c \in \mathbb{Z^+}$
I will prefer to have a analytical solution if it exists, other wise a polynomial time solution is also welcome (if it exists).
Note: I've put $c \in \mathbb{Z^+}$ for your convenience. It's also fine if some one can give a solution for $c \in \mathbb{Z}$
For a general polynomial, $a_0+a_1x+\dots+a_nx^n$, with integer coefficients, you may find all rational roots as follows.
If a root is $x=\frac pq$, with coprime $p,q$, then
$$a_0q^n+a_1pq+\dots+a_np^n=0$$
Thus $p$ is a divisor of $a_0$ and $q$ is a divisor of $a_n$. You have thus a finite number of solutions for both $p$ and $q$: respectively all divisors of $a_0$ (up to sign) and all divisors of $a_n$. It's absolutely free of any heuristic. However, there may be many cases to check if $a_0$ or $a_n$ is a highly composite number, and anyway, you have to factor them first.
And of course, if the $a_i$ share a common factor, you should factor it out first to reduce the computation (this is easy with GCD).
To find only integer roots, consider only $q=1$ in the above.