```python
import math

def count_Odd_Squares(n, m):
    """
    Counts the number of integers in the range [n, m] that have an odd number of factors.
    A number has an odd number of factors if and only if it is a perfect square.
    The function calculates the number of perfect squares in the given range.
    """
    # The number of perfect squares up to x is floor(sqrt(x)).
    # The number of perfect squares in the range [n, m] is:
    # (number of perfect squares <= m) - (number of perfect squares < n)
    # which is equivalent to:
    # (number of perfect squares <= m) - (number of perfect squares <= n - 1)
    
    # Using math.isqrt is efficient for integer square roots (Python 3.8+)
    # For broader compatibility, math.floor(math.sqrt(x)) or int(x**0.5) can be used.
    
    # Using math.floor(math.sqrt()) for compatibility
    count_up_to_m = math.floor(math.sqrt(m))
    count_up_to_n_minus_1 = math.floor(math.sqrt(n - 1))
    
    return count_up_to_m - count_up_to_n_minus_1

```