arXiv (All)
open access
A Pair of Diophantine Equations Involving the Fibonacci Numbers
Let $a, b\in \mathbb{N}$ be relatively prime. Previous work showed that exactly one of the two equations $ax + by = (a-1)(b-1)/2$ and $ax + by + 1 = (a-1)(b-1)/2$ has a nonnegative, integral solution; furthermore, the solution is unique. Let $F_n$ be the $n$th Fibonacci number. When $(a,b) = (F_n, F
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- How large can $B_n$- and $D_n$-friezes be?#1106236
- Manuscript 114b - Commentary on fiqh#262627
- 1729 in the Mirror: Reversal and Affine Multiplication#1036973
- On pairs of triangular numbers whose product is a perfect square and pairs of intervals of successive integers with equal sums of squares#1123888
- Hartie Spirometru Ap. SPIROLAB III#284043
Record · ID 987382
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive