Here is the problem I am currently working on:
Suppose $\frac{a}{b}$ is a rational zero of the equation $$ a_0x^n+a_1x^{n-1}+...+a_{n-1}x+a_n = 0,$$
where $a$ and $b$ are relatively prime integers and $a_0,a_1,...,a_n$ are arbitrary integers. Show that $a$ is a divisor of $a_n$ and that $b$ is a divisor of $a_0$.
I have no idea how to even approach this proof. What I do know is that $a$ and $b$ are relatively prime integers. In other words, their greatest common divisor is $1$ (so here we have gcd$(a,b) = 1$).
EDIT:
Originally, the textbook begins the question as
Suppose that a/b is a rational zero of the equation...
I just put it here just to follow the format of the textbook. I believe I'm suppose to split the fraction $\frac{a}{b}$ as $$a * \frac{1}{b},$$
since the problem asks to show that $a$ is a divisor of $a_n$ and that $b$ is a divisor of $a_0$.