If $a_n = O(n^\alpha)$ and $b_n = o(n^\beta)$, prove that $a_nb_n = o(n^{(\alpha + \beta)})$ and $a_n+b_n = O(\max(n^\alpha, n^\beta))$.
For the part about $a_nb_n = o(n^{(\alpha + \beta)})$, I get that I am supposed to set it up so that
$|a_n| < Mn^\alpha$ for some positive real M for $n \geq n'$
$|b_n| < \epsilon n^\beta$ for all positive reals $\epsilon$ for $n \geq n''$
Then I choose the maximum of n' and n'', and I get
$|a_nb_n| < M\epsilon n^\alpha n^\beta$.
My question is does this finish the proof? If there is a positive real M multiplied by $\epsilon$, does that map to all $\epsilon$? How do you denote this? I think this is some real analysis proof here or I can just say a constant multiplied by epsilon is just epsilon?
For the sum proof, does it become big-O rather than little-O because it cannot be mapped to $\epsilon$ when you add the two parts?
Thank you in advance for the help.