π的两项Machin-like公式中一个大整数的数学判定
Algorithmic determination of a large integer in the two-term Machin-like formula for pi
摘要:
在我们早期的出版物中,我们已经展示了如何通过迭代来计算$$\fracπ{4}=2^{k-1}\arctan\left(\frac{1}{u_{1,k}}\right)+\arctan\left(\frac{1}{u_{2,k}}\right),\qquad k\in \mathbb{Z},\quad k\ge 1,$$类pi的两项Machin式公式中的有理数${u_{2,k}}$,其中${u_{1,k}}$可以选择为整数${u_{1,k}} = \left\lfloor{{a_k}/\sqrt{2-a_{k-1}}}\right\rfloor$,其嵌套根号定义为${a_k}=\sqrt{2+a_{k-1}}$和$a_0 = 0$。在这项工作中,我们报告了另一种方法来确定的整数$u_{1,k}$。该方法基于简单的迭代,并且在整数$u_{1,k}$的计算中不需要来自集合$\left\{a_k\right\}$的任何无理数。数学程序验证这些结果。
英文摘要:
In our earlier publication we have shown how to compute by iteration a rational number ${u_{2,k}}$ in the two-term Machin-like formula for pi of kind $$\fracπ{4}=2^{k-1}\arctan\left(\frac{1}{u_{1,k}}\right)+\arctan\left(\frac{1}{u_{2,k}}\right),\qquad k\in \mathbb{Z},\quad k\ge 1,$$ where ${u_{1,k}}$ can be chosen as an integer ${u_{1,k}} = \left\lfloor{{a_k}/\sqrt{2-a_{k-1}}}\right\rfloor$ with nested radicals defined as ${a_k}=\sqrt{2+a_{k-1}}$ and $a_0 = 0$. In this work we report an alternative method for determination of the integer $u_{1,k}$. This approach is based on a simple iteration and does not require any irrational (surd) numbers from the set $\left\{a_k\right\}$ in computation of the integer $u_{1,k}$. Mathematica programs validating these results are presented.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。