Given a number N, the task is to find the number which is less than or equals to N whose product of prime factors is maximum.
Note: If there is more than one number whose maximum product is equal, then print the smallest number of them.
Input: N = 12
Product of prime factor of all numbers before N:
2 = 2
3 = 3
4 = 2
5 = 5
6 = 2 * 3 = 6
7 = 7
8 = 2
9 = 3
10 = 2 * 5 = 10
11 = 11
12 = 2*3 = 6
The maximum of all the above is 11.
Input: N = 20
Approach: The idea is to use the concept of Seive of Eratosthenes to find the product of all the prime factors of N numbers and then find the minimum number whose product of prime factors is maximum. Below are the steps:
- Create a list of numbers from 1 to N and initialise every value with 1.
- Let p = 2 which is the first prime number. Iterate from p, count up in increments of p and multiply by p at each index of the list. These indexes will be p(p+1), p(p+2), p(p+3), etc.
If p is a prime number, then multiply with p at every index which is multiple of p. For p = 2, Multiply with 2 at index 2, 4, 6, 8, 10,..., till N.
- Repeat the above step for all the prime number till N.
- After finding the product of all prime factors till N, traverse the list of numbers and find the least number with maximum product.
Below is the implementation of the above approach:
Time Complexity: O(N2)
Auxiliary Space: O(N)
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Maximum number of prime factors a number can have with exactly x factors
- Print all numbers whose set of prime factors is a subset of the set of the prime factors of X
- First element of every K sets having consecutive elements with exactly K prime factors less than N
- Count numbers whose maximum sum of distinct digit-sum is less than or equals M
- Find number of factors of N when location of its two factors whose product is N is given
- Check if a number exists having exactly N factors and K prime factors
- Numbers less than N which are product of exactly two distinct prime numbers
- Find the row whose product has maximum count of prime factors
- Largest number with maximum trailing nines which is less than N and greater than N-D
- Number of Co-prime pairs from 1 to N with product equals to N
- Largest number less than N whose each digit is prime number
- Find maximum product of digits among numbers less than or equal to N
- Product of unique prime factors of a number
- Product of divisors of a number from a given list of its prime factors
- Number with maximum number of prime factors
- Number which has the maximum number of distinct prime factors in the range M to N
- Number of subarrays having product less than K
- Count number less than N which are product of perfect squares
- Nearest prime less than given number n
- Count pairs with sum as a prime number and less than n
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.