Joker has a sequence **P** of **n** integers. Each two elements in the sequence are **pairwise distinct**. He defines the strength of the sequence as the **expected value** of the greatest common divisor (**gcd**) of any **two** randomly chosen **distinct** numbers from the sequence.

This is a companion discussion topic for the original entry at https://toph.co/p/joker-s-gcd-test