Suppose you have 2 co-primes(a, b). you also have a big prime number (m). Now, how can you find the number of pairs(x, y) of co-primes in the range (a, b) such that product(x, y) < m. Condition: a < b < m Can this be done in O(n)?
Tell me more
×
Mathematics Stack Exchange is a question and answer site for
people studying math at any level and professionals in related fields. It's 100% free, no registration required.
