Infinite Expressions for Pi

  • John Wallis (1655) took what can now be expressed as

    and without using the binomial theorem or integration (not invented yet) painstakingly came up with a formula for  to be

     .

  • William Brouncker (ca. 1660‘s) rewrote Wallis‘ formula as a continued fraction, which Wallis and later Euler (1775) proved to be equivalent. It is unknown how Brouncker himself came up with the continued fraction, .
  • James Gregory (1671) & Gottfried Leibniz (1674) used the series expansion of the arctangent function, ,

    and the fact that arctan(1) = /4 to obtain the series

     .

    Unfortunately, this series converges to slowly to be useful, as it takes over 300 terms to obtain a 2 decimal place precision. To obtain 100 decimal places of , one would need to use at least 10^50 terms of this expansion!

  • History books credit Sir Isaac Newton (ca. 1730‘s) with using the series expansion of the arcsine function, ,

    and the fact that arctan(1/2) = /6 to obtain the series

     .

    This arcsine series converges much faster than using the arctangent. (Actually, Newton used a slightly different expansion in his original text.) This expansion only needed 22 terms to obtain 16 decimal places for .

  • Leonard Euler (1748) proved the following equivalent relations for the square of ,
  • Ko Hayashi (1989) found another infinite expression for  in terms of the Fibonacci numbers, .

原文链接http://www.geom.uiuc.edu/~huberty/math5337/groupe/expresspi.html

PI=atan(1.0)*4;

时间: 2024-08-10 19:43:33

Infinite Expressions for Pi的相关文章

PostgreSQL中initdb做了什么

在使用数据库前,是启动数据库,启动数据库前是initdb(初始化数据库):一起来看一下initdb做了什么吧. 初始化数据库的操作为: ./initdb -D /usr/local/pgsql/data initdb把用户指定的选项转换成对应的参数,通过外部程序调用的方式执行postgres程序.postgres程序在这种方式下将进入bootstrap模式创建数据集簇,并读取后端接口postgres.bki文件来创建模板数据库. /*-------------------------------

VS2010 C++调用Java的Jar包

在网上看了一圈,只有一个示例代码,而且运行有错误,下面给出正确代码: JarAppCall.h 1 #pragma once 2 3 4 class CJarAppCall 5 { 6 public: 7 CJarAppCall(void); 8 ~CJarAppCall(void); 9 10 /* 11 @brief 执行Jar包调用,等待执行完成返回 12 @param[in] strJarDir jar包目录 13 @param[in] strJarName jar包名称 14 @ret

HookIAT的启动程序

1 // 启动程序.cpp : 定义控制台应用程序的入口点. 2 // 3 4 #include "stdafx.h" 5 #include <Windows.h> 6 #include <TlHelp32.h> 7 #include <iostream> 8 #include <Psapi.h> 9 10 #pragma comment(lib,"psapi.lib") 11 using namespace std;

windows 下隐藏 system 函数弹窗

概述 下面的程序是解决windows 下面调用 system() 函数的时候,会有窗口弹出的问题 头文件 #include <windows.h> 源码 /** * @brief 普通字符转宽字符 * * @param lpcszStr 普通字符 * @param lpwszStr 转换后的宽字符 * @param dwSize 存储宽字符的缓冲区大小 * * @return */ BOOL MByteToWChar(LPCSTR lpcszStr, LPWSTR lpwszStr, DWOR

前置病毒感染方式学习笔记

本文学习自:关于PE病毒的编写学习(一~六) by yangbostar 代码也来源于此,经过一些修改,还不是很完善.如没有添加感染标记,检查感染的文件是否已被感染过. 前置病毒,和资源感染类似,资源感染是病毒把宿主程序添加到程序的资源中,替换覆盖原程序,运行时将宿主程序释放成一个临时文件运行.前置病毒是读取病毒和宿主程序数据,然后将病毒和宿主程序数据再以病毒 --> 宿主程序的顺序写入宿主程序文件,运行时创建一个临时文件,读取程序中宿主程序的数据写入临时文件运行. 文件型病毒至少有这四个模块:

LA 6459 Infinite Go (模拟,搜索)

https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4470 Go is a proverbial board game originated in China. It has been proved to be the most difficult board game in the world. "The rules

Infinite House of Pancakes(贪心)

Problem At the Infinite House of Pancakes, there are only finitely many pancakes, but there are infinitely many diners who would be willing to eat them! When the restaurant opens for breakfast, among the infinitely many diners, exactly D have non-emp

Codeforces Round #301 (Div. 2) E . Infinite Inversions 树状数组求逆序数

E. Infinite Inversions time limit per test 2 seconds memory limit per test 256 megabytes input standard input  output standard output There is an infinite sequence consisting of all positive integers in the increasing order: p = {1, 2, 3, ...}. We pe

POJ 3358- Period of an Infinite Binary Expansion(欧拉函数+欧拉定理)

Period of an Infinite Binary Expansion Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Submit Status Practice POJ 3358 Appoint description:  System Crawler  (2015-04-08) Description Let {x} = 0.a1a2a3... be the binary rep