title: Reducing partition prob to decision prob
body: <p>We have the related and well known problems:</p>
  
  <p><strong>1) PARTITION (decision problem): 
  Given a set S of n natural numbers. Is it possible to find a subset T of S such that the sum of the numbers of T is equal to the sum of the numbers of T\S?</strong></p>
  
  <p><strong>2) PARTITION (general problem): 
  Given a set S of n natural numbers. Assuming the answer of the decision problem 1) to this set is 'yes' then find such a subset.</strong></p>
  
  <p>Simple question: How can we solve 2) in polynomial time if we have an algorithm that solves 1) in polynomial time?</p>