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?
I am a bit confused by your phrasing (no offense meant), but I think you are referring to the rational root test. Hopefully, this link is helpful:
Let $P(x)$ be a polynomial of degree $d$ with integer coefficients and let $x$ be an integer root. Then
$$P(x)=0=p_dx^d+p_{d-1}x^{d-1}+\cdots p_0=p_0\mod x$$
and $x$ must divide $p_0$.
The theorem holds for rational $x=\dfrac ab$ where the fraction is irreducible. Considering
$$b^dP\left(\frac ab\right)=0$$ you will conclude that $a$ divides $b^dp_0$, hence $p_0$.
It follows immediately from the rational root theorem that if $$ax^3+bx+c=0,$$ with $a,b,c\in\mathrm Z$ has a rational root $p/q$ with $p$ and $q$ coprime, then $p$ divides $c$ and $q$ divides $a.$
Therefore, if $a=1,$ it is clear that if no root of the corresponding cubic divides $c,$ then there can be no rational roots, since all the rational roots in this case (if they exist) must be integers.
