Given two positive integers n and r where n > r >1. The task is to find the value of f(n)/(f(r)*f(n-r)). F(n) is deined as follows:
1-1 *2-2 *3-3 *….. n-n
Input: n = 5, r = 3 Output: 1/200000 Input: n = 3, r = 2 Output: 1/27
A naive approach to solve this question is to calculate f(n), f(r) and f(n-r) separately and then calculating the result as per given formula but that will cost a bit high of time complexity.
A better approach to solve this question is to find the greater value among r and n-r and then after using the property f(n) = f(n-1)* n-n = f(n-1)/nn of given function, eliminate the greater among f(r) and f(n-r) from numerator and denominator. After that calculate the rest of value by using simple loop and power function.
find max(r, n-r).
iterate from max(r, n-r) to n
result = ((result * i-i / (i-max(r, n-r)) -(i-max(r, n-r)) )
Below is the implementation of the above approach:
- Find K such that |A - K| = |B - K|
- Find value of (1^n + 2^n + 3^n + 4^n ) mod 5
- Find value of (n^1 + n^2 + n^3 + n^4) mod 5 for given n
- Find (1^n + 2^n + 3^n + 4^n) mod 5 | Set 2
- Find 2^(2^A) % B
- Find N from the value of N!
- Find the value of max(f(x)) - min(f(x)) for a given F(x)
- Find F(n) when F(i) and F(j) of a sequence are given
- Find any pair with given GCD and LCM
- Find the sum of the series x(x+y) + x^2(x^2+y^2) +x^3(x^3+y^3)+ ... + x^n(x^n+y^n)
- Find the sum of the series 2, 5, 13, 35, 97...
- Find sum of the series 1-2+3-4+5-6+7.......
- Find the sum of series 3, 7, 13, 21, 31....
- Find gcd(a^n, c) where a, n and c can vary from 1 to 10^9
- Find Kth smallest value for b such that a + b = a | b
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.