Given a:b and b:c. The task is to write a program to find ratio a:b:c
Input: a:b = 2:3, b:c = 3:4 Output: 2:3:4 Input: a:b = 3:4, b:c = 8:9 Output: 6:8:9
Approach: The trick is to make the common term ‘b’ equal in both ratios. Therefore, multiply the first ratio by b2 (b term of second ratio) and the second ratio by b1.
Given: a:b1 and b2:c
Solution: a:b:c = (a*b2):(b1*b2):(c*b1)
If a : b = 5 : 9 and b : c = 7 : 4, then find a : b : c.
Here, Make the common term ‘b’ equal in both ratios.
Therefore, multiply the first ratio by 7 and the second ratio by 9.
So, a : b = 35 : 63 and b : c = 63 : 36
Thus, a : b : c = 35 : 63 : 36
Below is the implementation of the above approach:
- Program to find HCF (Highest Common Factor) of 2 Numbers
- Program to find the count of coins of each type from the given ratio
- Find the number which when added to the given ratio a : b, the ratio changes to c : d
- C++ Program for Common Divisors of Two Numbers
- Sum of two numbers if the original ratio and new ratio obtained by adding a given number to each number is given
- Java Program for Common Divisors of Two Numbers
- Ratio of the distance between the centers of the circles and the point of intersection of two transverse common tangents to the circles
- Ratio of the distance between the centers of the circles and the point of intersection of two direct common tangents to the circles
- Deriving the expression of Fibonacci Numbers in terms of golden ratio
- Program to calculate the profit sharing ratio
- Find if it is possible to get a ratio from given ranges of costs and quantities
- Find nth Fibonacci number using Golden ratio
- Program to find LCM of 2 numbers without using GCD
- Program to find LCM of two numbers
- Program to find GCD or HCF of two 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.