cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A244644 Consider the method used by Archimedes to determine the value of Pi (A000796). This sequence denotes the number of iterations of his algorithm which would result in a difference of less than 1/10^n from that of Pi.

Original entry on oeis.org

0, 1, 3, 5, 6, 8, 10, 11, 13, 15, 16, 18, 20, 21, 23, 25, 26, 28, 29, 31, 33, 34, 36, 38, 39, 41, 43, 44, 46, 48, 49, 51, 53, 54, 56, 58, 59, 61, 63, 64, 66, 68, 69, 71, 73, 74, 76, 78, 79, 81, 83, 84, 86, 88, 89, 91, 93, 94, 96, 98, 99, 101, 103, 104, 106, 108, 109, 111, 113, 114
Offset: 0

Views

Author

William H. Richardson and Robert G. Wilson v, Jul 03 2014

Keywords

Comments

It takes on average 5/3 iterations to yield another digit in the decimal expansion of Pi.
The side of a 96-gon inscribed in a unit circle is equal to sqrt(2-sqrt(2+sqrt(2+sqrt(2+sqrt(3))))). This is the size of one of the two polygons that Archimedes used to derive that 3 + 10/70 < Pi < 3 + 10/71.
In the Mathematica program, we started with an inscribed triangle and a circumscribed triangle of a unit circle and used decimal precision to just over a 1000 places.
The perimeter of the circumscribed 3*2^n-polygon exceeds Pi by more than the deficit of the perimeter of the inscribed 3*2^n-polygon. If we were to give twice the weight of the inscribed 3*2^n-polygon to that of the circumscribed 3*2^n-polygon, then the convergence would be twice as fast!
From A.H.M. Smeets, Jul 12 2018: (Start)
Archimedes's scheme: set upp(0) = 2*sqrt(3), low(0) = 3 (hexagons); upp(n+1) = 2*upp(n)*low(n)/(upp(n)+low(n)) (harmonic mean, i.e., 1/upp(n+1) = (1/upp(n) + 1/low(n))/2), low(n+1) = sqrt(upp(n+1)*low(n)) (geometric mean, i.e., log(low(n+1)) = (log(upp(n+1)) + log(low(n)))/2), for n >= 0. Invariant: low(n) < Pi < upp(n); variant function: upp(n)-low(n) tends to zero for n -> inf. The error of low(n) and upp(n) decreases by a factor of approximately 4 each iteration, i.e., approximately 2 bits are gained by each iteration.
From Archimedes's scheme, set r(n) = (2*low(n) + upp(n))/3, r(n) > Pi and the error decreases by a factor of approximately 16 for each iteration, i.e., approximately 4 bits are gained by each iteration. This is often called "Snellius acceleration".
For similar schemes see also A014549 (in this case with quadratically convergence), A093954, A129187, A129200, A188615, A195621, A202541.
Note that replacing "5/3" by "log(10)/log(4)" would be better in the first comment. (End)

Examples

			Just averaging the initial two triangles (3.89711) would yield Pi to one place of accuracy, i.e., the single digit '3'. Therefore a(0) = 0.
The first iteration yields, as the perimeters of the two hexagons, 4*sqrt(3) and 6. Their average is ~ 3.2320508 which is within 1/10 of the true value of Pi. Therefore a(1) = 1.
a(3) = 5 since it takes 5 iterations of Archimedes's algorithm to drive the averaged value of the circumscribed 96-gon and the inscribed 96-gon to yield a value within 0.001 of the correct value of Pi.
a(4) = 6 since it takes 6 iterations of Archimedes's algorithm to drive the averaged value of the circumscribed 3*2^6-gon and the inscribed 3*2^6-gon to yield a value within 0.0001 of the correct value of Pi.

References

  • Petr Beckmann, A History of Pi, 5th Ed. Boulder, Colorado: The Golem Press (1982).
  • Jonathan Borwein and David Bailey, Mathematics by Experiment, Second Edition, A. K. Peters Ltd., Wellesley, Massachusetts 2008.
  • Jonathan Borwein & Keith Devlin, The Computer As Crucible, An Introduction To Experimental Mathematics, A. K. Peters, Ltd., Wellesley, MA, Chapter 7, 'Calculating [Pi]' pp. 71-79, 2009.
  • Eli Maor, The Pythagorean Theorem, Princeton Science Library, Table 4.1, page 55.
  • Daniel Zwillinger, Editor-in-Chief, CRC Standard Mathematical Tables and Formulae, 31st Edition, Chapman & Hall/CRC, Boca Raton, London, New York & Washington, D.C., 2003, §4.5 Polygons, page 324.

Links

Crossrefs

Cf. A000796.

Programs

  • Mathematica
    a[n_] := a[n] = N[2 a[n - 1] b[n - 1]/(a[n - 1] + b[n - 1]), 2^10]; b[n_] := b[n] = N[ Sqrt[ b[n - 1] a[n]], 2^10]; a[-1] = 2Sqrt[27]; b[-1] = a[-1]/2; f[n_] := Block[{k = 0}, While[ 10^n*((a[k] + b[k])/4 -Pi) > 1, k++]; k]; Array[f, 70]

Formula

Conjecture: There exists a c such that a(n) = floor(n*log(10)/log(4)+c); where c is in the range [0.08554,0.10264]. Critical values to narrow the range are believed to be at a(74), a(133), a(192), a(251), a(310), a(366), a(425), a(484). - A.H.M. Smeets, Jul 23 2018

A202537 Decimal expansion of x satisfying e^x-e^(-2x)=1.

Original entry on oeis.org

3, 8, 2, 2, 4, 5, 0, 8, 5, 8, 4, 0, 0, 3, 5, 6, 4, 1, 3, 2, 9, 3, 5, 8, 4, 9, 9, 1, 8, 4, 8, 5, 7, 3, 9, 3, 7, 5, 9, 4, 1, 6, 4, 2, 2, 4, 2, 0, 1, 9, 5, 4, 3, 0, 0, 2, 9, 2, 8, 3, 9, 3, 8, 3, 6, 1, 6, 5, 4, 8, 9, 0, 5, 5, 0, 5, 8, 3, 1, 8, 2, 0, 1, 7, 0, 1, 3, 5, 0, 8, 5, 1, 5, 9, 0, 0, 9, 1, 2
Offset: 0

Views

Author

Clark Kimberling, Dec 21 2011

Keywords

Comments

If u>0 and v>0, there is a unique number x satisfying e^(ux)-e^(-vx)=1. Guide to related sequences, with graphs included in Mathematica programs:
u.... v.... x
1.... 1.... A002390
1.... 2.... A202537
1.... 3.... A202538
2.... 1.... A202539
3.... 1.... A202540
2.... 2.... A202541
3.... 3.... A202542
1/2..1/2... A202543
Suppose that f(x,u,v) is a function of three real variables and that g(u,v) is a function defined implicitly by f(g(u,v),u,v)=0. We call the graph of z=g(u,v) an implicit surface of f. For an example related to A202537, take f(x,u,v)=e^(ux)-e^(-vx)-1 and g(u,v) = a nonzero solution x of f(x,u,v)=0. If there is more than one nonzero solution, care must be taken to ensure that the resulting function g(u,v) is single-valued and continuous. A portion of an implicit surface is plotted by Program 2 in the Mathematica section.

Examples

			0.382245085840035641329358499184857393759416422...

Links

Crossrefs

Cf. A002390.

Programs

  • Mathematica
    (* Program 1:  A202537 *)
u = 1; v = 2;
f[x_] := E^(u*x) - E^(-v*x); g[x_] := 1
Plot[{f[x], g[x]}, {x, -2, 2}, {AxesOrigin -> {0, 0}}]
r = x /. FindRoot[f[x] == g[x], {x, .3, .4}, WorkingPrecision -> 110]
RealDigits[r]  (* A202537 *)
(* Program 2: implicit surface for e^(ux)-e(-vx)=1 *)
f[{x_, u_, v_}] := E^(u*x) - E^(-v*x) - 1;
t = Table[{u, v, x /. FindRoot[f[{x, u, v}] == 0, {x, 0, .3}]}, {v, 1, 4}, {u, 2, 20}];
ListPlot3D[Flatten[t, 1]] (* for A202537 *)
First[ RealDigits[ Log[ Root[#^3 - #^2 - 1 & , 1]], 10, 99]] (* Jean-François Alcover, Feb 26 2013 *)
  • PARI
    solve(x=0,1,exp(x)-exp(-2*x)-1) \\ Charles R Greathouse IV, Feb 26 2013
  • PARI
    log(polrootsreal(x^3-x^2-1)[1]) \\ Charles R Greathouse IV, Feb 07 2025

Extensions

Digits from a(90) on corrected by Jean-François Alcover, Feb 26 2013

A377813 Decimal expansion of arctanh(phi-1).

Original entry on oeis.org

7, 2, 1, 8, 1, 7, 7, 3, 7, 5, 8, 9, 4, 0, 5, 1, 7, 1, 2, 4, 6, 6, 3, 8, 3, 7, 0, 1, 3, 6, 5, 5, 2, 6, 3, 4, 7, 0, 2, 7, 7, 6, 5, 0, 1, 5, 7, 8, 4, 9, 0, 7, 7, 9, 4, 9, 1, 5, 2, 7, 2, 5, 3, 2, 6, 0, 2, 4, 5, 8, 0, 1, 4, 1, 2, 3, 3
Offset: 0

Views

Author

Colin Linzer, Nov 08 2024

Keywords

Comments

arctanh(phi-1) is the solution for real valued x in tanh(x) = d/dx tanh(x).
arctanh(phi-1) is the solution for real valued x in cosh(x) * sinh(x) = 1. - Colin Linzer, Nov 22 2024

Examples

			0.721817737589405171246638370136552634702...

Links

Crossrefs

Cf. A001622, A202541.

Programs

  • Mathematica
    RealDigits[ArcTanh[GoldenRatio - 1], 10, 120][[1]] (* Amiram Eldar, Nov 12 2024 *)
  • PARI
    atanh((1+sqrt(5))/2-1)

Formula

Equals (1/2)*log(2+sqrt(5)).
Equals (3/2)*log(phi).
Equals arccosh(sqrt(phi)).
Equals arcsinh(sqrt(phi-1)).
Equals f(phi-1) with f(x) = (1/2)*log((2-x+2*sqrt(1-x))/x), a branch of the converse function of the derivative of tanh(x).
Equals 3*A202541. - Hugo Pfoertner, Nov 12 2024
Equals arcsinh(2)/2. - Colin Linzer, Nov 22 2024
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.