Maximum number of prime factors a number can have with exactly x factors
Given an integer X, denoting the number of factors of a positive integer N can have. The task is to find the maximum number of distinct prime factors the number N can have.
Examples:
Input: X = 9
Output: 2
Explanation:
Some of the possible numbers having 9 factors are:
256: 1, 2, 4, 8, 16, 32, 64, 128, 256
Number of prime factors = 1
36: 1, 2, 3, 4, 6, 9, 12, 18, 36
Number of prime factors = 2
Input: X = 8
Output: 3
Some of the numbers having 8 factors are:
128 : 1, 2, 4, 8, 16, 32, 64, 128
Number of prime factors = 1
24 : 1, 2, 3, 4, 6, 8, 12, 24
Number of prime factors = 2
30 : 1, 2, 3, 5, 6, 10, 15, 30
Number of prime factors = 3
Approach: The key observation in the problem is, any positive natural number can be represented as product of its prime factors as follows:
// Number can be represented as product
// prime factors as follows
// Total number of factors of N can be // defined as followsNumber of Factors = (p+1) * (q+1) * (r+1)..
In the above problem, the number of factors are given which can be used to find the maximum prime factors possible for a number with the given count of factors as follows:
If X can be expressed as product of K numbers then we have at most K primes in X.
In Order to split X as product of maximum number of values,
all the values should be prime.
X = (p+1) * (q+1) * (r+1)
// So the maximum number of prime
// factors of the given number greater
// than 1 can lead to a number N.
Let's say X = 12
X = 2 * 2 * 3
Then possible N can be:
N = a(2-1) * b(2-1) * c(3-1)
N = a1 * b1 * c2
// Here a, b, and c can be any distinct prime
// numbers to get the possible value of N
N = 21 * 31 * 52
N = 150
let's say X = 8
X = 2 * 2 * 2
N = 21 * 31 * 51
N = 30
Therefore, the maximum count of prime divisors of a number can have is the count of the prime factors (can be repetitive also) in the factorization of the count of factors of the number.
Below is the implementation of the above approach:
C++
#include <iostream>
#include <math.h>
using namespace std;
int countPrimeFactors( int n)
{
if (n == 1)
return 0;
int cnt = 0;
while (n % 2 == 0) {
cnt++;
n = n / 2;
}
for ( int i = 3; i <= sqrt (n);
i += 2) {
while (n % i == 0) {
cnt++;
n = n / i;
}
}
if (n > 2)
cnt++;
return cnt;
}
int main()
{
int x = 8;
int prime_factor_cnt = countPrimeFactors(x);
cout << prime_factor_cnt << endl;
return 0;
}
|
Java
import java.io.*;
public class GFG {
static int countPrimeFactors( int n)
{
if (n == 1 )
return 0 ;
int cnt = 0 ;
while (n % 2 == 0 ) {
cnt++;
n = n / 2 ;
}
for ( int i = 3 ; i <= Math.sqrt(n); i += 2 ) {
while (n % i == 0 ) {
cnt++;
n = n / i;
}
}
if (n > 2 )
cnt++;
return cnt;
}
public static void main(String[] args)
{
int x = 8 ;
int prime_factor_cnt = countPrimeFactors(x);
System.out.print(prime_factor_cnt + "\n" );
}
}
|
Python3
import math
def countPrimeFactors(n):
if (n = = 1 ):
return 0
cnt = 0
while (n % 2 = = 0 ):
cnt + = 1
n = n / / 2
for i in range ( 3 , int (math.sqrt(n)) + 1 , 2 ):
while (n % i = = 0 ):
cnt + = 1
n = n / / i
if (n > 2 ):
cnt + = 1
return cnt
x = 8
prime_factor_cnt = countPrimeFactors(x)
print (prime_factor_cnt)
|
C#
using System;
class GFG {
static int countPrimeFactors( int n)
{
if (n == 1)
return 0;
int cnt = 0;
while (n % 2 == 0) {
cnt++;
n = n / 2;
}
for ( int i = 3;
i <= Math.Sqrt(n); i += 2) {
while (n % i == 0) {
cnt++;
n = n / i;
}
}
if (n > 2)
cnt++;
return cnt;
}
static public void Main()
{
int x = 8;
int prime_factor_cnt = countPrimeFactors(x);
Console.Write(prime_factor_cnt);
}
}
|
Javascript
<script>
function countPrimeFactors(n)
{
if (n == 1)
return 0;
let cnt = 0;
while (n % 2 == 0)
{
cnt++;
n = parseInt(n / 2);
}
for (let i = 3; i <= Math.sqrt(n); i += 2)
{
while (n % i == 0)
{
cnt++;
n = parseInt(n / i);
}
}
if (n > 2)
cnt++;
return cnt;
}
let x = 8;
let prime_factor_cnt = countPrimeFactors(x);
document.write(prime_factor_cnt);
</script>
|
Time Complexity: O(N1/2)
Auxiliary Space: O(1)
Last Updated :
13 Dec, 2022
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...