Java Program to Find minimum sum of factors of number
Last Updated :
05 Dec, 2018
Given a number, find minimum sum of its factors.
Examples:
Input : 12
Output : 7
Explanation:
Following are different ways to factorize 12 and
sum of factors in different ways.
12 = 12 * 1 = 12 + 1 = 13
12 = 2 * 6 = 2 + 6 = 8
12 = 3 * 4 = 3 + 4 = 7
12 = 2 * 2 * 3 = 2 + 2 + 3 = 7
Therefore minimum sum is 7
Input : 105
Output : 15
public class Main {
static int findMinSum( int num)
{
int sum = 0 ;
for ( int i = 2 ; i * i <= num; i++) {
while (num % i == 0 ) {
sum += i;
num /= i;
}
}
sum += num;
return sum;
}
public static void main(String[] args)
{
int num = 12 ;
System.out.println(findMinSum(num));
}
}
|
Please refer complete article on Find minimum sum of factors of number for more details!
Share your thoughts in the comments
Please Login to comment...