2000 character limit reached
On the Diophantine equation $B_{n_{1}}+B_{n_{2}}=2^{a_{1}}+2^{a_{2}}+2^{a_{3}}$ (2212.06372v2)
Published 13 Dec 2022 in math.NT
Abstract: In this study we find all solutions of the Diophantine equation $B_{n_{1}}+B_{n_{2}}=2{a_{1}}+2{a_{2}}+2{a_{3}}$ in positive integer variables $(n_{1},n_{2},a_{1},a_{2},a_{3}),$ where $B_{n}$ denotes the $n$-th balancing number.