An asymptotic formula for \(\pi\) (Q1115899): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q213633
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Péter Kiss / rank
 
Normal rank

Revision as of 06:18, 11 February 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
    0 references
    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
    0 references
    binary linear recurrence
    0 references
    0 references