Given a natural number N, the task is to find the Nth compositorial number.
Compositorial of a number refers to the product of all the positive composite integers up to N.
The compositorial of a number N is denoted by
Input: N = 4
The first 4 composite numbers are 4, 6, 8, 9. Therefore, the compositorial is the product of all the numbers.
Input: N = 5
Approach: The following steps can be followed to compute the Nth compositorial number.
- Get the number N.
- Find all the composite numbers up to N.
- Product the obtained composite numbers.
- Print the product.
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.
- Number of factors of very large number N modulo M where M is any prime number
- Find minimum number to be divided to make a number a perfect square
- How to check if a given number is Fibonacci number?
- Find the smallest number whose digits multiply to a given number n
- Find n'th number in a number system with only 3 and 4
- Build Lowest Number by Removing n digits from a given number
- Count number of subsets of a set with GCD equal to a given number
- Count number of ways to divide a number in 4 parts
- Querying maximum number of divisors that a number in a given range has
- Check if a number is a power of another number
- Find the Largest number with given number of digits and sum of digits
- Finding number of digits in n'th Fibonacci number
- Smallest number by rearranging digits of a given number
- Number with maximum number of prime factors
- Convert a number m to n using minimum number of given operations
- Determine whether a given number is a Hyperperfect Number
- Find count of digits in a number that divide the number
- Convert a binary number to hexadecimal number
- Number of times the largest perfect square number can be subtracted from N
- Find if a number is divisible by every number in a list
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.