The maximum entropy method for the Hausdorff moment problem suffers from ill conditioning as it uses monomial basis {1,x,x2,...,xn}. The maximum entropy method for the Chebyshev moment probelm was studied to overcome this drawback in. In this paper we review and modify the maximum entropy method for the Hausdorff and Chebyshev moment problems studied in and present the maximum entropy method for the Legendre moment problem. We also give the algorithms of converting the Hausdorff moments into the Chebyshev and Lengendre moments, respectively, and utilizing the corresponding maximum entropy method.

Let $\left( R,\,\mathfrak{m} \right)$ be a local ring and $\mathfrak{a}$ be an ideal of $R$ . The inequalities

$$\text{ht}\left( \mathfrak{a} \right)\,\le \,\text{cd}\left( \mathfrak{a},\,R \right)\,\le \,\text{ara}\left( \mathfrak{a} \right)\,\le \,l\left( \mathfrak{a} \right)\,\le \,\mu \left( \mathfrak{a} \right)$$

are known. It is an interesting and long-standing problem to determine the cases giving equality. Thanks to the formal grade we give conditions in which the above inequalities become equalities.

Hayman has shown that if f is a transcendental meromorphic function and n ≽ 3, then fn f′ assumes all finite values except possibly zero infinitely often. We extend his result in three directions by considering an algebroid function ω, its monomial ωn0 ω′n1, and by estimating the growth of the number of α-points of the monomial.