Given three numbers, our task is to find the largest number by which when given 3 numbers are divided leads to same remainder. It may be assumed that all given numbers are given in increasing order.
Input : a = 62, b = 132, c = 237 Output : 35 35 leads to same remainder 27 when divides 62, 132 and 237. Input : a = 74, b = 272, c = 584 Output : 6
The idea is based on the fact that if a number leaves same remainder with a, b and c, then it would divide their differences. Let us understand assuming that x is our result. Let a = x*d1 + r where r is the remainder when a is divided by x. Similarly we can write b = x*d2 + r and b = x*d3 + r. So the logic is here we first find differences of all three pairs and after that, we find greatest common divisor of differences to maximize result.
Below is the implementation of above idea.
- Program to find remainder when large number is divided by r
- Program to find remainder when large number is divided by 11
- Minimum number of operations on a binary string such that it gives 10^A as remainder when divided by 10^B
- Minimum integer such that it leaves a remainder 1 on dividing with any element from the range [2, N]
- Remainder with 7 for large numbers
- Largest number in [2, 3, .. n] which is co-prime with numbers in [2, 3, .. m]
- Largest N digit number divisible by given three numbers
- Find minimum number to be divided to make a number a perfect square
- Program for quotient and remainder of big number
- Check if a large number can be divided into two or more segments of equal sum
- Largest Even and Odd N-digit numbers
- Smallest and Largest sum of two n-digit numbers
- Largest palindrome which is product of two n-digit numbers
- Sum and product of k smallest and k largest composite numbers in the array
- Largest of two distinct numbers without using any conditional statements or operators
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.