Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
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.

Summary

We haven't generated a summary for this paper yet.