Given an integer N, the task is to find the total number of multiplicative partition for N.
Multiplicative Partition: Number of ways of factoring of an integer with all factors greater than 1.
Input: N = 20
Multiplicative partitions of 20 are:
2 × 2 × 5 = 2 × 10 = 4 × 5 = 20.
Input: N = 30
Multiplicative partitions of 30 are:
2 × 3 × 5 = 2 × 15 = 6 × 5 = 3 × 10 = 30
Approach: The idea is to try for every divisor of the N and then recursively break the dividend to get the multiplicative partitions. Below are the illustrations of the steps of approach:
- Initialize minimum factor as 2. Since it is the minimum factor other than 1.
- Start a loop from i = minimum to N – 1, and check if the number divides N and N/i > i, then increment the counter by 1 and again call the same function. Since, i divides n so it means i and N/i can be factorized some more times.
If N = 30, let i = min = 2
30 % 2 = 0, so again recur with (2, 15)
15 % 3 = 0, so again recur with (3, 5)
and so on.
Below is the implementation of the above approach:
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.
- Multiplicative order
- Modular multiplicative inverse
- Modular multiplicative inverse from 1 to n
- Print all multiplicative primes <= N
- Multiplicative Congruence method for generating Pseudo Random Numbers
- Generate all unique partitions of an integer
- Maximize partitions such that no two substrings have any common character
- Partitions possible such that the minimum element divides all the other elements of the partition
- Count of binary strings of length N having equal count of 0's and 1's and count of 1's ≥ count of 0's in each prefix substring
- Count of binary strings of length N having equal count of 0's and 1's
- Count numbers < = N whose difference with the count of primes upto them is > = K
- Count of all values of N in [L, R] such that count of primes upto N is also prime
- Count subarrays such that remainder after dividing sum of elements by K gives count of elements
- Check if count of even divisors of N is equal to count of odd divisors
- Count of Subsets containing only the given value K
- Count pairs with Odd XOR
- Count of subarrays with sum at least K
- Count rotations of N which are Odd and Even
- Count Divisors of n in O(n^1/3)
- Count of all possible values of X such that A % X = B
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.