It is shown that each rational approximant to (?,?2)t given by the Jacobi¿Perron algorithm (JPA) or modified Jacobi¿Perron algorithm (MJPA) is optimal, where ? is an algebraic function (a formal Laurent series over a finite field) satisfying ?3+k?-1=0 or ?3+kd?-d=0. A result similar to the main result of Ito et al. [On simultaneous approximation to (a,a2) with a3+ka-1=0, J. Number Theory 99 (2003) 255¿283] is obtained.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados