Help Calculating My "Deviation"

I created a "distribution deviation" where for $left{a_1,…,a_kright}$ we take all take the mean of all combinations of $frac{minleft{a_{i},a_{j}right}}{maxleft{a_{i},a_jright}}$ ($i,jinleft{1,…,kright}$) without repetitions, subtract by one and take the absolute value.

$$left|1-frac{1}{sumlimits_{i=1}^{k-1}i}sum_{j=2}^{k}sum_{i=1}^{j-1}frac{minleft{a_{i},a_{j}right}}{maxleft{a_{i},a_{j}right}}right|$$

For infinite $k$ we simply take

$$left|1-frac{2}{k(k-1)}sum_{j=1}^{k}sum_{i=1}^{j-1}frac{minleft{a_{i},a_{j}right}}{maxleft{a_{i},a_{j}right}}right|$$

This works well for values of $a_i$ that are extremely small.

I want to apply this deviation to the differences of elements in the folner sequence of $left{frac{ln(m)}{ln(n)}:minmathbb{N}_{>0},ninmathbb{N}_{>1}right}cap[0,1]$. The folner sequence is

$$g(d)=left{frac{ln(m)}{ln(n)}:minmathbb{N}_{>0},ninmathbb{N}_{>1},nle dright}cap[0,1]$$

For every $dinmathbb{R}$, if we list $g(d)$ (note $g(d)$ is finite) as $left{a_1,…,a_{k}right}$ ($k$ is the number of elements in the list depending on $dinmathbb{R}$) we take $|a_{i+1}-a_i|$ where $i,jinleft{1,…,kright}$. My distribution deviation as $d,ktoinfty$.

$$lim_{ktoinfty}left|1-frac{2}{k(k-1)}sum_{j=2}^{k}sum_{i=1}^{j-1}frac{minleft{a_{j+1}-a_{j},a_{i+1}-a_{i}right}}{maxleft{a_{j+1}-a_{j},a_{i+1}-a_{i}right}}right|$$

Here is my attempt to do this

F[d_] := Abs[
   Differences[
    DeleteDuplicates[
     Sort[Flatten[
       Table[Log[m]/Log[n], {n, 2, d}, {m, 1, Floor[n]}]]]]]];
G[d_] := Table[
  N[Min[F[d][[i]], F[d][[j]]]/Max[F[d][[i]], F[d][[j]]], 10], {j, 2, 
   Length[F[100]]}, {i, 1, j - 1}]

Unfortunately it takes too long to load. Is there a way to shorten the time? Does my code match my math equations?