on the recursive sequence ๐‘ฅ๐‘›+๐Ÿ=max{๐‘ฅ๐‘›,๐ด}/๐‘ฅ๐Ÿ๐‘›๐‘ฅ๐‘›โˆ’๐Ÿ

Clicks: 65
ID: 163712
2010
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score โ€” reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Popular

Ranked #217 of 266 articles by views in Journal of the American Heart Association

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 266 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
We investigate the periodic nature of the solution of the max-type difference equation ๐‘ฅ๐‘›+1=max{๐‘ฅ๐‘›,๐ด}/๐‘ฅ2๐‘›๐‘ฅ๐‘›โˆ’1, ๐‘›=0,1,2,โ€ฆ, where the initial conditions are ๐‘ฅโˆ’1=๐ด๐‘Ÿ1 and ๐‘ฅ0=๐ด๐‘Ÿ2 for ๐ดโˆˆ(0,โˆž), and that ๐‘Ÿ1 and ๐‘Ÿ2 are positive rational numbers. The results in this paper solve the Open Problem proposed by Grove and Ladas (2005).
Reference Key
yalcinkaya2010discreteon Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Ibrahim Yalcinkaya;Cengiz Cinar;Ali Gelisken
Journal Journal of the American Heart Association
Year 2010
DOI
10.1155/2010/583230
URL
http://dx.doi.org/10.1155/2010/583230
Keywords
mathematics

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.