Given a number , find the number of distinct integers obtained by lcm(X, N)/X where X can be any positive number.
Input: N = 2 Output: 2 if X is 1, then lcm(1, 2)/1 is 2/1=2. if X is 2, then lcm(2, 2)/2 is 2/2=1. For any X greater than 2 we cannot obtain a distinct integer. Input: N = 3 Output: 2
It is known that lcm(x, y) = x*y/gcd(x, y).
lcm(X, N) = X*N/gcd(X, N) or, lcm(X, N)/X = N/gcd(X, N)
So only the distinct factors of can be the distinct integers possible. Hence count the number of distinct factors of N including 1 and N itself, which is the required answer.
Below is the implementation of the above approach:
Time Complexity: O(sqrt(n))
- Total distinct pairs from two arrays such that second number can be obtained by inverting bits of first
- Check whether a number can be represented as sum of K distinct positive integers
- Check if the sum of distinct digits of two integers are equal
- Integers from the range that are composed of a single distinct digit
- Generate permutation of 1 to N such that absolute difference of consecutive numbers give K distinct integers
- Number of Co-prime pairs obtained from the sum of digits of elements in the given range
- 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 of integers x in range (1,N) for which x and x+1 have same number of divisors
- Print a number strictly less than a given number such that all its digits are distinct.
- Number of solutions for x < y, where a <= x <= b and c <= y <= d and x, y are integers
- Number of distinct subsets of a set
- Find the number of integers from 1 to n which contains digits 0's and 1's only
- Number of N digit integers with weight W
- Number expressed as sum of five consecutive integers
- Check whether a number has exactly three distinct factors or not
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.