arXiv (All)
open access
Generalizing a Pair of Diophantine Equations
For coprime integers $a$ and $b$, it is known that exactly one of the two Diophantine equations $$ ax+by\ =\ \frac{(a-1)(b-1)}{2} \qquad\text{and}\qquad 1+ax+by\ =\ \frac{(a-1)(b-1)}{2} $$ admits a nonnegative integer solution, and that this solution is unique. We first generalize this result by rep
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
- Analytic expressions pertaining to certain arithmetical functions#1011986
- The 1/2-Conjecture for $q$-Binomial Coefficients with Fractional Index#1110255
- Rational-Valued Affine Verifiers in Arthur--Merlin Proof Systems#189342
- Discrete-time polynomial systems with inputs and outputs: structure, reachability, observability, and minimal realizations#1131265
- Even universal binary Hermitian lattices over imaginary quadratic fields#1110012
Record · ID 986372
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