Abstract

Transformation of number sequences (convergence acceleration) is one of the classical chapters of numerical analysis. These algorithms are used both for solution of practical problems and for the development of more advanced numerical methods. At the same time, numerical methods have found numerous applications in the number theory. One of the classical problems of number theory is the proof of irrationality of some fundamental constants, where the high rate of convergence of sequences of rational numbers plays a crucial role. However, as far as we know, the applications of (classical) convergence acceleration algorithms to the proofs of irrationality do not exist. This study is an attempt to fill this gap and to draw attention to this direction of research.

Highlights

  • Ã Ý ÛÓÖ ×o Ë ÕÙ Ò ØÖ Ò× ÓÖÑ Ø ÓÒ× ̧ Ð Ö Ø ÓÒ Ó ÓÒÚ Ö Ò ÖÖ Ø Ó1

  • Limz 1 f (z) = δo1⁄2 μo1⁄2 μ1⁄21⁄4μo

  • Ï Ò Ö oÂo ÆÓÒÐ Ò Ö × ÕÙ Ò ØÖ Ò× ÓÖÑ Ø ÓÒ× ÓÖ Ø Ð Ö Ø ÓÒ Ó ÓÒÚ Ö Ò Ò Ø ×ÙÑÑ Ø ÓÒ Ó Ú Ö ÒØ × Ö × »» ÓÑÔÙØ Ö È Ý× × Ê ÔÓÖØo ÆÓÖØ 1ÀÓÐÐ Ò o Ñ×Ø Ö Ño Îo 1⁄21⁄4o ÔÔo 1⁄2 ¿ 1⁄2o1⁄2 μo

Read more

Summary

Introduction

Ã Ý ÛÓÖ ×o Ë ÕÙ Ò ØÖ Ò× ÓÖÑ Ø ÓÒ× ̧ Ð Ö Ø ÓÒ Ó ÓÒÚ Ö Ò ÖÖ Ø Ó1

Results
Conclusion
Full Text
Published version (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