W is the set of the first n positive odd numbers, where n is a positive integer. Given that n > k, where k is also a positive integer, x is the maximum value of the sum of k distinct members of W, and y is the minimum value of the sum of k distinct members of W, what is x + y?  Pick
A) kn	B) kn + k^2	C) kn + 2k^2	D) 2kn – k^2	E) 2kn
Probably the easiest way to solve this question would be to assume some values for n and k.   Say n=3, so W, the set of the first n positive odd numbers would be: W={1, 3, 5};   Say k=1, so X, the maximum value of the sum of K distinct members of W would simply be 5. Similarly, Y, the minimum value of the sum of K distinct members of W would simply be 1.   X+Y=5+1= 
<gadget id="calculator">5+1</gadget>
<output>6</output>
6.   Now, substitute n=3 and k=1 in the options provided to see which one yields 6. Only asnwer choice E fits: 2kn=2*3*1= 
<gadget id="calculator">2*3*1</gadget>
<output>6</output>
6.   Answer: 2kn.
<result>E</result>
W is the set of the first n positive odd numbers, where n is a positive integer. Given that n > k, where k is also a positive integer, x is the maximum value of the sum of k distinct members of W, and y is the minimum value of the sum of k distinct members of W, what is x + y?