Given two values ‘m’ and ‘n’ and the 5th term of an arithmetic progression is zero. The task is to find the ratio of mth and nth term of this AP.

**Examples:**

Input: m = 10, n = 20 Output: 1/3 Input: m = 10, n = 15 Output: 1/2

**Approach:** Acc. to the statement, 5th term is zero. Now understand the concept with an example. As A5=a+4*d=0.

Now, we have to find ratio of m = 10th term and n = 20th term.

A[10]

= A + 9 * d

= A5 + 5 * d

= 0 + 5 * d

=5 * dSimilarly, A[20]

= A + 19 * d

= A5 + 15 * d

= 0 + 15 * d

=15 * d

Now, we have to find ratio, so

Ans= A[10] / A[20]

**Below is the required implementation:**

## C++

`// C++ implementation of above approach ` `#include <bits/stdc++.h> ` `#define ll long long int ` `using` `namespace` `std; ` ` ` `// Function to find the ratio ` `void` `findRatio(ll m, ll n) ` `{ ` ` ` ` ` `ll Am = m - 5, An = n - 5; ` ` ` ` ` `// divide numerator by gcd to get ` ` ` `// smallest fractional value ` ` ` `ll numerator = Am / (__gcd(Am, An)); ` ` ` ` ` `// divide denominator by gcd to get ` ` ` `// smallest fractional value ` ` ` `ll denominator = An / (__gcd(Am, An)); ` ` ` ` ` `cout << numerator << ` `"/"` `<< denominator << endl; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` ` ` `// let d=1 as d doesn't affect ratio ` ` ` `ll m = 10, n = 20; ` ` ` ` ` `findRatio(m, n); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// java implementation of above approach ` ` ` `public` `class` `GFG { ` ` ` ` ` `// Function to calculate the GCD ` ` ` `static` `int` `GCD(` `int` `a, ` `int` `b) { ` ` ` `if` `(b==` `0` `) ` `return` `a; ` ` ` `return` `GCD(b,a%b); ` ` ` `} ` ` ` ` ` `// Function to find the ratio ` ` ` `static` `void` `findRatio(` `int` `m,` `int` `n) ` ` ` `{ ` ` ` `int` `Am = m - ` `5` `, An = n - ` `5` `; ` ` ` ` ` `// divide numerator by GCD to get ` ` ` `// smallest fractional value ` ` ` `int` `numerator = Am / GCD(Am, An) ; ` ` ` ` ` `// divide denominator by GCD to get ` ` ` `// smallest fractional value ` ` ` `int` `denominator = An / GCD(Am, An) ; ` ` ` ` ` `System.out.println(numerator + ` `"/"` `+ denominator); ` ` ` `} ` ` ` `// Driver code ` ` ` `public` `static` `void` `main (String args[]){ ` ` ` ` ` `// let d=1 as d doesn't affect ratio ` ` ` `int` `m = ` `10` `, n = ` `20` `; ` ` ` ` ` `findRatio(m, n); ` ` ` ` ` `} ` ` ` `// This code is contributed by ANKITRAI1 ` `} ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 implementation of above approach ` `# Function to find the ratio ` ` ` `from` `fractions ` `import` `gcd ` `def` `findRatio(m,n): ` ` ` `Am ` `=` `m ` `-` `5` ` ` `An ` `=` `n ` `-` `5` ` ` ` ` `# divide numerator by gcd to get ` ` ` `# smallest fractional value ` ` ` `numerator` `=` `Am` `/` `/` `(gcd(Am,An)) ` ` ` ` ` `# divide denominator by gcd to get ` ` ` `#smallest fractional value ` ` ` `denominator ` `=` `An ` `/` `/` `(gcd(Am, An)) ` ` ` `print` `(numerator,` `'/'` `,denominator) ` ` ` `# Driver code ` `# let d=1 as d doesn't affect ratio ` `if` `__name__` `=` `=` `'__main__'` `: ` ` ` `m ` `=` `10` ` ` `n ` `=` `20` ` ` `findRatio(m, n) ` ` ` `# this code is contributed by sahilshelangia ` |

*chevron_right*

*filter_none*

## C#

`// C# implementation of above approach ` ` ` `using` `System; ` `public` `class` `GFG { ` ` ` ` ` `// Function to calculate the GCD ` ` ` `static` `int` `GCD(` `int` `a, ` `int` `b) { ` ` ` `if` `(b==0) ` `return` `a; ` ` ` `return` `GCD(b,a%b); ` ` ` `} ` ` ` ` ` `// Function to find the ratio ` ` ` `static` `void` `findRatio(` `int` `m,` `int` `n) ` ` ` `{ ` ` ` `int` `Am = m - 5, An = n - 5 ; ` ` ` ` ` `// divide numerator by GCD to get ` ` ` `// smallest fractional value ` ` ` `int` `numerator = Am / GCD(Am, An) ; ` ` ` ` ` `// divide denominator by GCD to get ` ` ` `// smallest fractional value ` ` ` `int` `denominator = An / GCD(Am, An) ; ` ` ` ` ` `Console.Write(numerator + ` `"/"` `+ denominator); ` ` ` `} ` ` ` `// Driver code ` ` ` `public` `static` `void` `Main (){ ` ` ` ` ` `// let d=1 as d doesn't affect ratio ` ` ` `int` `m = 10, n = 20; ` ` ` ` ` `findRatio(m, n); ` ` ` ` ` `} ` ` ` ` ` `} ` |

*chevron_right*

*filter_none*

## PHP

`<?php ` `// PHP implementation of above approach ` ` ` `function` `__gcd(` `$a` `, ` `$b` `) ` `{ ` ` ` `if` `(` `$b` `== 0) ` `return` `$a` `; ` ` ` `return` `__gcd(` `$b` `, ` `$a` `% ` `$b` `); ` `} ` ` ` `// Function to find the ratio ` `function` `findRatio(` `$m` `, ` `$n` `) ` `{ ` ` ` `$Am` `= ` `$m` `- 5; ` `$An` `= ` `$n` `- 5; ` ` ` ` ` `// divide numerator by gcd to get ` ` ` `// smallest fractional value ` ` ` `$numerator` `= ` `$Am` `/ (__gcd(` `$Am` `, ` `$An` `)); ` ` ` ` ` `// divide denominator by gcd to ` ` ` `// get smallest fractional value ` ` ` `$denominator` `= ` `$An` `/ (__gcd(` `$Am` `, ` `$An` `)); ` ` ` ` ` `echo` `$numerator` `, ` `"/"` `, ` ` ` `$denominator` `; ` `} ` ` ` `// Driver code ` ` ` `// let d=1 as d doesn't affect ratio ` `$m` `= 10; ` `$n` `= 20; ` ` ` `findRatio(` `$m` `, ` `$n` `); ` ` ` `// This code is contributed ` `// by inder_verma ` `?> ` |

*chevron_right*

*filter_none*

**Output:**

1/3

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.

## Recommended Posts:

- Ratio of mth and nth terms of an A. P. with given ratio of sums
- Nth term where K+1th term is product of Kth term with difference of max and min digit of Kth term
- Minimize Nth term of an Arithmetic progression (AP)
- Find Pth term of a GP if Mth and Nth terms are given
- Arithmetic Progression containing X and Y with least possible first term
- Program for N-th term of Arithmetic Progression series
- Sum of P terms of an AP if Mth and Nth terms are given
- Mth bit in Nth binary string from a sequence generated by the given operations
- Find Nth term of the series where each term differs by 6 and 2 alternately
- Nth term of a sequence formed by sum of current term with product of its largest and smallest digit
- Find the Nth term of the series where each term f[i] = f[i - 1] - f[i - 2]
- Nth term of given recurrence relation having each term equal to the product of previous K terms
- Sum of two numbers if the original ratio and new ratio obtained by adding a given number to each number is given
- Find the number which when added to the given ratio a : b, the ratio changes to c : d
- Longest string in non-decreasing order of ASCII code and in arithmetic progression
- Program for N-th term of Geometric Progression series
- Longest Arithmetic Progression | DP-35
- Find the missing number in Arithmetic Progression
- Check whether Arithmetic Progression can be formed from the given array
- Count of AP (Arithmetic Progression) Subsequences in an array

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.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.