Consider a cubic equation with integer coefficients (coefficient of $x^3$ being $1$). In hit and trial method, we assume each divisors of the last term as the root and check if it satisfies the equation. If none of the divisors of the last term satisfy the equation, we are sure that the equation has no integer roots.
Euler also concluded that, no fractional roots can exist in the above case. Can someone please explain me how?