Abstract
Though we cannot improve on the upper bound in Dirichlet's approximation theorem,Kaindl has shown that the upper bound can be lowered fromtn totn−tn−1−tn−2−...−t−1, if we admit equality. We show thatKaindl's upper bound is lowest possible in this case. The result is then generalized to linear forms.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
