BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Elchin Hasanalizade (University of Lethbridge)
DTSTART:20221017T180000Z
DTEND:20221017T190000Z
DTSTAMP:20260423T035417Z
UID:NTC/7
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/NTC/7/">Sums
  of Fibonacci numbers close to a power of $2$</a>\nby Elchin Hasanalizade 
 (University of Lethbridge) as part of Lethbridge number theory and combina
 torics seminar\n\nLecture held in University of Lethbridge: M1040 (Markin 
 Hall).\n\nAbstract\nThe Fibonacci sequence $(F_n)_{n \\geq 0}$ is the bina
 ry recurrence sequence defined by $F_0 = F_1 = 1$ and\n$$\nF_{n+2} = F_{n+
 1}  + F_n \\text{ for all } n \\geq 0.\n$$\nThere is a broad literature on
  the Diophantine equations involving the Fibonacci numbers. In this talk\,
  we will study the Diophantine inequality\n$$\n| F_n + F_m - 2^a | < 2^{a/
 2}\n$$\nin positive integers $n\, m$ and $a$ with $n \\geq m$. The main to
 ols used are lower bounds for linear forms in logarithms due to Matveev an
 d Dujella-Pethö version of the Baker-Davenport reduction method in Diopha
 ntine approximation.\n
LOCATION:https://researchseminars.org/talk/NTC/7/
END:VEVENT
END:VCALENDAR