Consider counting for each element in divisors the count of elements in nums divisible by it using bruteforce.

After counting for each divisor, take the one with the maximum count. In case of a tie, take the minimum one of them.