is what MathCad gives.
Correct, but I personally think it is best to use the iteration you are on. For example, 0, then 1 then 2 then 3 then 4 then 5, 6, 7, 8, 9, 10
This helps you keep track of where you are, you could technically do
10, 9, 8, 7, 6, 5, 6, 7, 8, 9, 10 or 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 or 0, 1, 2, 3, 4, 5, 4, 3, 2, 1, 0
Or heck, any combination in between, such as 10, 1, 8, 3, 6, 5, 6, 7, 2, 1, 10
But with all those terms, organization will be helpful, and doing it in order will probably keep you from making errors.
Also, don't forget to multiply that combination of (n, n-k) by the coefficient of x to the power of n- k, and y to the power of k.
so
On a side note, is the reason why pascal's triangle is symmetrical. (ie: coefficients of 1, 2, 1 and 1, 3, 3, 1 etc)
-------------
So, for the purposes of visualizing what's going on, the total breakdown will be:
Notice how easy it is to find any given term, because the combinations are sequential you can just find to find our term. This would be a bit harrier if we randomly alternated between our 2 options, you could easily lose track of where you are in the middle, and would have to count from the beginning. That is why I recommend you count sequentially from 0 to n in your combinations.