Finding divisors of an integer is common task. We all did it in some time or other during our programming courses. We know that there are several ways to find divisors of an integer N . All of them involve some kind of programming using loops. But what if we ask you to solve the reverse problem?
Given all the proper (all the divisors except 1 and N ) positive divisors of a positive composite integer N, you need to find the value of N .