A degree problem for the compositum of two number fields (Q2313196)

A triplet $(a,b,c)$ of positive integers is said to be compositum-feasible if there exist two number fields $K$ and $L$ of degrees $a$ and $b$, respectively, such that their compositum $KL$ is of degree $c$. The primitive element theorem gives that a compositum-feasible triplet $(a,b,c)$ is a sum-feasible triplet, that is, there are two algebraic numbers $\alpha$ and $\beta$ of degrees $a$ and $b$, respectively, such that $\alpha +\beta $ is of degree $c$. Similarly, an element $(a,b,c)$ of $\mathbb{N}^{3}$ is called a product-feasible triplet, if there exist two algebraic numbers $\alpha$ and $\beta$ of degrees $a$ and $b$, respectively, such that $\alpha \beta$ is of degree $c$. It has been, recently, proved by the first author and \textit{A. Dubickas} [Colloq. Math. 143, No. 2, 159--167 (2016; Zbl 1409.11084)] that a sum-feasible triplet is a product-feasible triplet. In the paper under review, the authors continue to investigate triplets defined above. Mainly, they determine all compositum-feasible triplets $(a,b,c)$ satisfying $a\leq b$ and $b\in \{8,9\}$; earlier the first author et al. [Publ. Mat., Barc. 56, No. 2, 413--448 (2012; Zbl 1297.11133); Math. Nachr. 286, No. 2--3, 171--180 (2013; Zbl 1277.11097)] classified all compositum-feasible triplets $(a,b,c)$, where $a\leq b$ $\leq 7$. Also, the authors show that a triplet of the form $(a,a,ap)$, where $p$ is a prime number satisfying $a/2<p<a-2$, is not product-feasible, and a triplet of the form $(a,a,a(a-2))$, where $a\geq 4$, is compositum-feasible for even $a$, and is not product-feasible for odd $a$.