Good day.
Suppose $a$ is rational number, $p$ is positive integer and $a^{1/p}$ is irrational. If we want to eliminate irrationality in the denominator of the fraction $\frac{1}{a^{1/p}}$, then there is obvious solution $\frac{a^{1-1/p}}{a}$.
Some situations like $\frac{1}{a^{1/n} - b^{1/n}}$ are also nice. But what if we have a more general situation - $\frac{1}{a_1^{\frac{1}{p_1}} + ... +a_n^{\frac{1}{p_n}}}$? I think that it's always possible to eliminate irrationality but i don't have an idea yet how to prove it and how to implement it algorithmically.
Any ideas will be highly appreciated. Thanks in advance.
This is always possible; Let $P$ be the minimal polynomial over $\mathbb{Q}$ of the element $\alpha=a_1^{\frac{1}{p_1}}+\cdots+a_n^{\frac{1}{p_n}}$ the coefficient of $P$ are all rationals,in particular the product $p$ of its roots $\alpha_1=\alpha,\alpha_2,\cdots,\alpha_n$ is rational so : $$\frac{1}{\alpha}=\frac{\alpha_2\cdots\alpha_n}{p}$$
and this is equivalent to eliminating the irrationality in denominator.
Examples