Let $[H,G]$ be a distributive interval of finite groups and $K_1, \dots , K_n$ its atoms. We will prove that the answer is yes for $n<6$ (the case $n \ge 6$ is still open). As a corollary we will see that it is also true if $|[H,G]| < 64$ or $\vert G : H \vert < 486$. *Lemma*: There is at most one atom $K_i$ with $|K_i:H| = 2$. *Proof*: First of all if $|K_i:H| = 2$ then $H \triangleleft K_i$. If there is an other atom $K_j$ with $|K_j:H| = 2$, then $H \triangleleft (K_i \vee K_j)$. But the interval $[H, K_i \vee K_j]$ is a sublattice of the distributive interval $[H,G]$, so it is also distributive. But by normality, $[H, K_i \vee K_j] \simeq [1, (K_i \vee K_j)/H]$, so by distributivity and Ore's theorem, $(K_i \vee K_j)/H$ is a cyclic group, moreover it would have exactly two minimal subgroups, $K_i/H$ and $K_j/H$. But if a cyclic group has exactly two minimal subgroups, they must be of different order, contradiction with $|K_i:H| = |K_j:H| = 2$. $\square$ Now we just need to use the following theorem (proved in [this paper][1]): > *Theorem:* If $[H,G]$ is distributive with $\sum_{i=1}^n \vert K_i : H \vert^{-1} \le 2$, then it is linearly primitive. *Corollary:* If the distributive interval $[H,G]$ has $< 6$ atoms, then it is linearly primitive. *Proof*: by the lemma $\sum_i \vert K_i : H \vert^{-1} \le 1/2 + (n-1)/3 $. But $1/2 + (n-1)/3 \le 2$ iff $n \le 11/2$. $\square$ *Corollary*: It is also true if $|[H,G]| < 2^6 = 64$ or $\vert G : H \vert < 2 \cdot 3^5 = 486$. *Proof*: A distributive lattice with $6$ atoms has at least height $6$ and $2^6$ elements (see [here][2]). Then a distributive interval $[H,G]$ with $6$ atoms, has an index $|G:H| \ge 2^6$, but if $|G:H| = 2^6$ then any atom $K_i$ satisfies $|K_i:H| = 2$, which contradicts the lemma; so there exists an atom $K_i$ with $|K_i:H| \neq 2$, i.e. $|K_i:H| \ge 3$. Next we apply an induction on the interval $[K_i,G]$ and we get $|G:K_i| \ge 2 \cdot 3^4$. $\square$ [1]: http://arxiv.org/abs/1505.06649 [2]: http://mathoverflow.net/q/212340/34538