Compute the minimum Hamming distance among three bit strings; see https://math.stackexchange.com/questions/3523712.

Question3523712.java

import java.util.Random;

public class Question3523712 {
    final static long ntrials = 10000028000;
    final static Random random = new Random();
    public static void main (String [] args) {
        
        long sum = 0;
        for (long k = 0;k < ntrials;k++) {
            long a = random.nextLong();
            long b = random.nextLong();
            long c = random.nextLong();
            sum += Math.min(Math.min(hamming(a, b),hamming(b, c)),hamming(c, a));
        }
        
        System.out.println(sum / (double) ntrials);
    }
    
    static int hamming(long a,long b) {
        int hamming = 0;
        for (int i = 0;i < 64;i++) {
            if ((a & 1) != (b & 1))
                hamming++;
            a >>= 1;
            b >>= 1;
        }
        return hamming;
    }
}