Given an integer n, we need to find a range of positive integers such that all the number in that range are composite and length of that range is n. You may print anyone range in the case of more than one answer. A composite number is a positive integer that has at least one divisor other than 1 and itself (Source : wiki )
Input : 3 Output : [122, 124] Explanation 122, 123, 124 are all composite numbers
The solution is little tricky. Since there are many possible answers, we discuss a generalized solution here.
Let the length of range be n and range starts from a then, a, a+1, a+2, ...., a+n-1 all should be composite. So the problem boils down to finding such 'a'. If we closely observe p! (where p is a positive integers) then we will find that, p! has factors of 2, 3, 4, ..., p-1, Hence if we add i to p! such that 1 < i < p, then p! + i has a factor i, so p! + i must be composite. So we end up finding p! + 2, p! + 3, .... p! + p-1 are all composite and continuous integers forming a range [p! + 2, p! + p-1] The above range consists of p-2 elements. For a range of n elements we need to consider (n+2)! If we take a = (n+2)! + 2, Then, a + 1 = (n+2)! + 3 Then, a + 2 = (n+2)! + 4 ... Then, a + n-1 = (n+2)! + n+1 Hence, a = (n+2)! + 2 = 2*3*....*(n+2) + 2 a has 2 as its divisor because (n+2)! and 2 both divides 2 a + 1 = 2*3*....*(n+2) + 3 a + 1 has 3 as its divisor because (n+2)! and 3 both divides 3 ... a + n-1 = 2*3*....*(n+2) + n+1 a + n-1 has n+1 as its divisor because (n+2)! and n+1 both divides n+1 Therefore range will be [ (n+2)! + 2, ( (n+2)! + 2 ) + n-1]
Example for above algorithm
n = 3 Then a = (n+2)! + 2 a = 5! + 2 a + 1 = 5! + 3 a + 2 = 5! + 4 Here a is divisible by 2 Here a + 1 is divisible by 3 Here a + 2 is divisible by 4 Hence a, a+1, a+2 are all composites
Analysis of above algorithm
Time Complexity : O(n)
Auxiliary Space : O(1)
This article is contributed by Pratik Chhajer. 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 write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Sum of all composite numbers lying in the range [L, R] for Q queries
- Queries for the difference between the count of composite and prime numbers in a given range
- Find two Composite Numbers such that there difference is N
- Find a sequence of N prime numbers whose sum is a composite number
- Sum of all odd length palindromic numbers within the range [L, R]
- Bitwise AND of the sum of prime numbers and the sum of composite numbers in an array
- Find XOR of numbers from the range [L, R]
- Find numbers with K odd divisors in a given range
- Find numbers with n-divisors in a given range
- C/C++ Program to find Prime Numbers between given range
- Find the number of divisors of all numbers in the range [1, n]
- Number of ways to obtain each numbers in range [1, b+c] by adding any two numbers in range [a, b] and [b, c]
- Highly Composite Numbers
- Composite numbers with digit sum 1
- Find the count of numbers that can be formed using digits 3, 4 only and having length at max N.
- Find all the possible numbers in a range that can be evenly divided by its digits
- Find kth smallest number in range [1, n] when all the odd numbers are deleted
- Split n into maximum composite numbers
- Product of all the Composite Numbers in an array
- Represent the given number as the sum of two composite numbers
Improved By : vt_m