Given an integer N, find and show the number of pairs which satisfies the following conditions:
- Square of distance between those two numbers is equal to the LCM of those two numbers.
- The GCD of those two numbers is equal to the product of two consecutive integers.
- Both numbers in the pair should be less than or equal to N.
NOTE: Only those pairs should be displayed which follows both the above conditions simultaneously and those numbers must be less than or equal to N.
Input: 10 Output: No. of pairs = 1 Pair no. 1 --> (2, 4) Input: 500 Output: No. of pairs = 7 Pair no. 1 --> (2, 4) Pair no. 2 --> (12, 18) Pair no. 3 --> (36, 48) Pair no. 4 --> (80, 100) Pair no. 5 --> (150, 180) Pair no. 6 --> (252, 294) Pair no. 7 --> (392, 448)
The tables shown below will give a clear view of what is to be found :
Above tables show GCD formed by the product of two consecutive numbers and its corresponding multiples in which UNIQUE PAIR exists corresponding to each value. Green entries in each row form a unique pair for corresponding GCD.
Note: In the above tables,
- For 1st entry, GCD=2, 1st and the 2nd multiple of 2 form the Unique Pair, (2, 4)
- Similarly, for the 2nd entry, GCD=6, 2nd and the 3rd multiple of 6 form the Unique Pair, (12, 18)
- Similarly, moving on, for Zth entry, i.e for GCD = Z*(Z+1), it is clear that the unique pair will comprise of Zth and (Z+1)th multiple of GCD = Z*(Z+1). Now, Zth multiple of GCD is Z * (Z*(Z+1)) and (Z+1)th multiple of GCD will be (Z + 1) * (Z*(Z+1)).
- And as the limit is N, so the second number in the unique pair must be less than or equal to the N. So, (Z + 1) * (Z*(Z+1)) <= N. Simplifying it further, the desired relation is derived Z3 + (2*Z2) + Z <=N
This forms a pattern and from the mathematical calculation, it is derived that for a given N, the total number of such unique pairs (say, Z) will follow a mathematical relation shown below:
Z3 + (2*Z2) + Z <= N
Below is the required implementation:
No. of pairs = 7 Pair no. 1 --> (2, 4) Pair no. 2 --> (12, 18) Pair no. 3 --> (36, 48) Pair no. 4 --> (80, 100) Pair no. 5 --> (150, 180) Pair no. 6 --> (252, 294) Pair no. 7 --> (392, 448)
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.
- Find the GCD of LCM of all unique pairs in an Array
- Find element in array with frequency equal to sum of frequencies of other elements
- All pairs whose xor gives unique prime
- Max count of unique ratio/fraction pairs in given arrays
- Count of distinct possible pairs such that the element from A is greater than the element from B
- Check if frequency of each element in given array is unique or not
- Unique element in an array where all elements occur K times except one | Set 2
- Count of all possible pairs having sum of LCM and GCD equal to N
- Number of pairs such that their HCF and LCM is equal
- Pairs with GCD equal to one in the given range
- Count pairs from two arrays having sum equal to K
- Count pairs with set bits sum equal to K
- Count of pairs from Array with sum equal to twice their bitwise AND
- Count of pairs having bit size at most X and Bitwise OR equal to X
- Number of pairs in an array having sum equal to product
- Count all distinct pairs with product equal to K
- Count pairs of natural numbers with GCD equal to given number
- Count the pairs in an array such that the difference between them and their indices is equal
- Count of pairs of integers whose difference of squares is equal to N
- Count of pairs upto N such whose LCM is not equal to their product for Q queries
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.