Count Equal and Divisible Pairs in an Array.JAVA

class Solution {
    public int countPairs(int[] nums, int k) {
        int product,count=0;
        for(int i=0;i<nums.length;i++){
            for(int j=i+1;j<nums.length;j++){
                if(nums[i]==nums[j]){
                    product=i*j;
                    if(product%k==0){
                        count=count+1;
                    }
                }
            }
        }
        return count;
    }
}