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:20260404T132231Z
UID:NTC/7
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/NTC/7
 /">Sums of Fibonacci numbers close to a power of $2$</a>\nby Elchin Hasana
 lizade (University of Lethbridge) as part of Lethbridge number theory and 
 combinatorics seminar\n\nLecture held in University of Lethbridge: M1040 (
 Markin Hall).\n\nAbstract\nThe Fibonacci sequence $(F_n)_{n \\geq 0}$ is t
 he binary 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 litera
 ture 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 tools used are lower bounds for linear forms in logarithms due to Mat
 veev and Dujella-Pethö version of the Baker-Davenport reduction method in
  Diophantine approximation.\n
LOCATION:https://stable.researchseminars.org/talk/NTC/7/
END:VEVENT
END:VCALENDAR