Given a positive integer N, the task is to find the count of all the numbers M such that when the number N is divided by M, the quotient is equal to its remainder i.e (⌊N/M⌋ = N mod M) where ⌊ ⌋ denotes the floor value of a given number. Explanation: When 8 is divided by 3 and 7, it returns the same Quotient and Remainder.
For More Information Please Refer: