Given x, y, z and n, find smallest n digit number which is divisible by x, y and z.
Input : x = 2, y = 3, z = 5 n = 4 Output : 1020 Input : x = 3, y = 5, z = 7 n = 2 Output : Not possible
1) Find smallest n digit number is pow(10, n-1).
2) Find LCM of given 3 numbers x, y and z.
3) Find remainder of the LCM when divided by pow(10, n-1).
4) Add the “LCM – remainder” to pow(10, n-1). If this addition is still a n digit number, we return the result. Else we return Not possible.
Suppose n = 4 and x, y, z are 2, 3, 5 respectively.
1) First find the least four digit number i.e. 1000,
2) LCM of 2, 3, 5 so the LCM is 30.
3) Find the reminder of 1000 % 30 = 10
4) Subtract the remainder from LCM, 30 – 10 = 20. Result is 1000 + 20 = 1020.
Below is the implementation of 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.
- Largest N digit number divisible by given three numbers
- Count of N-digit numbers having digit XOR as single digit
- Count numbers in a range with digit sum divisible by K having first and last digit different
- Count of N-digit Numbers having Sum of even and odd positioned digits divisible by given numbers
- Smallest K digit number divisible by X
- C++ Program for Smallest K digit number divisible by X
- Java Program for Smallest K digit number divisible by X
- Smallest N digit number divisible by N
- Smallest N digit number divisible by all possible prime digits
- Number of quadruples where the first three terms are in AP and last three terms are in GP
- Count n digit numbers divisible by given number
- Sum of n digit numbers divisible by a given number
- Count three-digit numbers having difference X with its reverse
- Prove that atleast one of three consecutive even numbers is divisible by 6
- Count of Numbers in Range where first digit is equal to last digit of the number
- Find two numbers made up of a given digit such that their difference is divisible by N
- Print numbers such that no two consecutive numbers are co-prime and every three consecutive numbers are co-prime
- Number of Groups of Sizes Two Or Three Divisible By 3
- Smallest multiple of 3 which consists of three given non-zero digits
- Smallest number divisible by first n 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 email@example.com. 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.
Improved By : Mithun Kumar