Let n be even. Show how the composite Simpson rule with 2n equally spaced nodes can be computed from the case of n equally spaced nodes with a minimum amount of additional work.
I've been working on this problem for almost 2 hours now and can't seem to get anywhere. I feel it has something to do with the initial conditions on the [a,b] interval ($x_i=a+ih \text{ and } h=\frac{b-a}{2}$) and working the problem so there are the same number of terms to calculate in 2n as there are in n. There's always replacing any instance of n with 2n and halving h, but I don't think that's what they're looking for.
Apologies of I don't make any sense, any help would be much appreciated, I just cannot seem to wrap my head around this.