For division algorithm, would I do something along the lines of n³+2n = 3q+r and go from there?
For induction, I did the base case, which is true, and so then I moved on to the k+1 case, in which I did (n+1)³ + 2(n+1) to get n³+3n²+5n+3, which isn't all the way divisible by 3. WHat step did I do wrong here?