Assume we wish to partition the square roots of the integers from 1 to 100 in to two piles of fifty numbers every, such that the sum of the numbers in the first pile is as close as possible to the sum of the numbers in the second pile.  If youcould  use minimum computer time to answer this question, what computations would  you perform on the computer in that time?  

According to problem, sum of square roots in two piles should be as close as  possible. For that we would add square roots of odd numbers. In one pile and square roots of even numbers in another pile. As for natural numbers also if we require to separate into two piles according to nearest equal sum requirement above solution  will work i.e.1+3+......................+99, 2+4+ ..............+100.Square root is a  strictly enhancing function for positive numbers.  So result holds for square root also.