On the Diophantine equation B_n₁ + B_n₂ = 2a₁ + 2a₂ + 2a₃

DOI10.46298/CM.10476zbMATH Open1547.11019MaRDI QIDQ6585129FDOQ6585129

Prasanta Kumar Ray, K. Bhoi

Publication date: 9 August 2024

Published in: Communications in Mathematics (Search for Journal in Brave)

zbMATH Keywords

linear forms in logarithmsBaker-Davenport reduction methodbalancing sequence

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Exponential Diophantine equations (11D61) Linear forms in logarithms; Baker's method (11J86)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear combinations of factorials and \(S\)-units in a binary recurrence sequence
• Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
• An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
• On The diophantine equationFn+F_m=2^a
• Powers of two as sums of three Fibonacci numbers
• On the Diophantine equation $F_{n}-F_{m}=2^{a}$
• On Diophantine equations involving sums of Fibonacci numbers and powers of $2$

This page was built for publication: On the Diophantine equation \(B_{n_{1}} + B_{n_{2}} = 2^{a_{1}} + 2^{a_{2}} + 2^{a_{3}}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6585129)