Given a number n, generate a list of n composite numbers.
Input : 5 Output : 122, 123, 124, 125 Input : 10 Output : 3628802, 3628803, 3628804, 3628805, 3628806, 3628807, 3628808, 3628809, 3628810
The idea here is using the properties of . Since , then numbers , all divide . Therefore is divisible by 2, is divisible by 3 ….. is divisible by n. And by above pattern they are consecutive composites.
We find (n+1)!, then we print numbers (n+1)! + 2, (n+1)! + 3, …. (n+1)! + (n + 1).
Below is the implementation of above approach:
# Python3 program to print n consecutive
# composite numbers.
# function to find factorial
# of given number
def factorial( n):
res = 1;
for i in range(2, n + 1):
res *= i;
# Prints n consecutive numbers.
fact = factorial(n + 1);
for i in range(2, n + 2):
print(fact + i, end = ” “);
# Driver Code
n = 4;
# This code is contributed by mits
122 123 124 125
The above solution causes overflow very soon (for small values of n). We can use technique to find factorial of large number to avoid overflow.
- Generate original array from difference between every two consecutive elements
- Composite numbers with digit sum 1
- Split n into maximum composite numbers
- Product of all the Composite Numbers in an array
- Find a range of composite numbers of given length
- Sum and Product of all Composite numbers which are divisible by k in an array
- Find a sequence of N prime numbers whose sum is a composite number
- Sum and product of k smallest and k largest composite numbers in the array
- Queries for the difference between the count of composite and prime numbers in a given range
- Interesting facts about Fibonacci numbers
- Print numbers such that no two consecutive numbers are co-prime and every three consecutive numbers are co-prime
- An interesting solution to get all prime numbers smaller than n
- Generate all palindromic numbers less than n
- New Algorithm to Generate Prime Numbers from 1 to Nth Number
- Algorithm to generate positive rational numbers
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.