------
## 最终结论
```python
def find_Divisor(start, end):
    divisor_count = {}
    for num in range(start, end + 1):
        for i in range(1, num + 1):
            if num % i == 0:
                if i in divisor_count:
                    divisor_count[i] += 1
                else:
                    divisor_count[i] = 1
    max_occurring_divisor = max(divisor_count, key=divisor_count.get)
    return max_occurring_divisor

# Test cases
assert find_Divisor(2,2) == 2
assert find_Divisor(2,5) == 2
assert find_Divisor(5,10) == 2
```