1. IR @ Alliance University
  2. Journal Articles Archive
  3. Articles to be qced
Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/6334
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAlexandru Ciolan-
dc.contributor.authorFlorian Luca-
dc.date.accessioned2024-02-27T05:56:59Z-
dc.date.available2024-02-27T05:56:59Z-
dc.date.issued2017-
dc.identifier.urihttp://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/6334-
dc.description.abstractGiven a recurrent sequence U := {Un}n::a:O we consider the problem of counting Mu(x), the number of integers 11 ::: x such that U11 = u2 + nv2 for some integers u, v. We will show that Mu(x) « x(log x)-o.os for a large class of ternary sequences. Our method uses many ingredients from the proof of Alba Gonzalez and the second author [1] that MF(x) « x(logx)-0· 06 , with F the Fibonacci sequence.-
dc.publisherJournal of the Ramanujan Mathematical Society-
dc.titleCounting terms Un of third order linear recurrences with Un= u2 + nv2-
dc.volVol 32-
dc.issuedNo 2-
Appears in Collections:Articles to be qced

Files in This Item:
File SizeFormat 
Counting terms Un of third order linear.pdf
  Restricted Access		611.8 kBAdobe PDFView/Open Request a copy
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.