arXiv (OAI Expanded)
open access
Diophantine m-tuples of Triangular Numbers
A $m$-tuple with the property $D(n)$ is a tuple of $m$ positive integers $(a_1, a_2, \dots, a_m)$ such that $a_i a_j + n$ is an square, for $1 \le i < j \le m$. The $k$th triangular number is $T_k = \frac{k(k+1)}{2}$ for nonnegative integers $k$. We consider $D(1)$ tuples consisting only of triangul
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
- Diophantine m-tuples of Triangular Numbers#780995
- Regular dyadic triangulations of delta-matroid polytopes#1012520
- Sums of wedges : Conforming weighted Delaunay Triangulations are polynomial in fixed dimension / Dimitrios Bogiokas, Ugo Finnendahl, Thorsten Seidelmann, Marc Alexa#669324
- Hexagonal Geometric Triangulations#984779
- Banyaknya Siklus Hamilton pada Graf k-Regular#213676
Record · ID 779620
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