Given an integer X, the task is to find the possible values of Q for the pair (Q, R) such that their product is equal to X times their sum, where Q ≤ R and X < 107. Print the total count of such values of Q along with values.
Input: X = 3
On taking Q = 4 and R = 12,
LHS = 12 x 4 = 48
RHS = 3(12 + 4) = 3 x 16 = 48 = LHS
Similarly, the equation also holds for value Q = 6 and R = 6.
LHS = 6 x 6 = 36
RHS = 3(6 + 6) = 3 x 12 = 36 = LHS
Input: X = 16
17, 18, 20, 24, 32
If Q = 17 and R = 272,
LHS = 17 x 272 = 4624
RHS = 16(17 + 272) = 16(289) = 4624 = LHS.
Similarly, there exists a value R for all other values of Q given in the output.
Approach: The idea is to understand the question to form an equation, that is (Q x R) = X(Q + R).
- The idea is to iterate from 1 to X and check for every if ((( X + i ) * X) % i ) == 0.
- Initialize a resultant vector, and iterate for all the values of X from 1.
- Check if the above condition holds true. If it does then push the value X+i in the vector.
- Let’s break the equation in order to understand it more clearly,
The given expression is (Q x R) = X(Q + R)
On simplifying this we get,
=> QR – QX = RX
or, QR – RX = QX
or, R = QX / (Q – X)
- Hence, observe that (X+i) is the possible value of Q and (X+i)*X is the possible value of R.
Below is the implementation of the above approach:
2 4 6
Time Complexity: O(N)
Auxiliary Space: O(X)
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.
- Sum of all numbers formed having 4 atmost X times, 5 atmost Y times and 6 atmost Z times
- Count of pairs in a given range with sum of their product and sum equal to their concatenated number
- Largest possible Subset from an Array such that no element is K times any other element in the Subset
- Find any K distinct odd integers such that their sum is equal to N
- Minimum possible value T such that at most D Partitions of the Array having at most sum T is possible
- Count of pairs upto N such whose LCM is not equal to their product for Q queries
- Count different numbers possible using all the digits their frequency times
- Choose two elements from the given array such that their sum is not present in any of the arrays
- Convert a number of length N such that it contains any one digit at least 'K' times
- Minimum deletions required such that any number X will occur exactly X times
- Count pairs from 1 to N such that their Sum is divisible by their XOR
- Count pairs from an array having product of their sum and difference equal to 1
- Count pairs from an array having product of their sum and difference equal to 0
- All possible values of floor(N/K) for all values of K
- Product of values of all possible non-empty subsets of given Array
- Find the first N integers such that the sum of their digits is equal to 10
- Minimum number of primes required such that their sum is equal to N
- Find the pair (a, b) with minimum LCM such that their sum is equal to N
- Times required by Simple interest for the Principal to become Y times itself
- Count of pairs in an array such that the highest power of 2 that divides their product is 1
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.