An asymptotic formula for \(\pi\) (Q1115899): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hilbert's Tenth Problem is Unsolvable / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3797259 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: DIOPHANTINE SETS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A New Formula for &#960 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On divisors of terms of linear recurrence sequences. / rank | |||
Normal rank |
Latest revision as of 14:10, 19 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An asymptotic formula for \(\pi\) |
scientific article |
Statements
An asymptotic formula for \(\pi\) (English)
0 references
1989
0 references
Let \(R_ 0,R_ 1,R_ 2,..\). be a nondegenerate binary linear recurrence of integers defined by \(R_ n=AR_{n-1}+BR_{n-2}\) \((n>1)\), where \(R_ 0\), \(R_ 1=1,and\) A, B are fixed nonzero integers. It is proved that \[ \sqrt{\frac{6\cdot \log | R_ 1\cdot R_ 2\cdot \cdot \cdot R_ N|}{\log [R_ 1,R_ 2,...,R_ N]}}\quad =\quad \pi +O(\frac{1}{\log N}) \] for any sufficiently large integer N ([ ] denotes the least common multiple of numbers).
0 references
binary linear recurrence
0 references