One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
https://doi.org/10.1007/bf01295367
Copy DOI
Export
Save
Share
Cite Journal: Monatshefte f�r Mathematik |  Publication Date: Sep 1, 1980 |
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.
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
