arXiv (All)
open access
Quantitative lower bound for Pythagorean pairs in boxes of prime powers
For each positive integer $N$, let $p_i$ be the $i$-th prime for $i\in\{1,\ldots,N\}$, and set $$ Φ_N=\left\{\prod_{i=1}^{N}p_i^{a_i}:a_i\in\{0,1,\ldots,N-1\}\right\}. $$ Write $f(N)$ for the largest cardinality of a subset of $Φ_N$ containing no two distinct legs of an integral right triangle. We
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
- Pythagorean pairs in boxes of prime powers#1249245
- On pairs of triangular numbers whose product is a perfect square and pairs of intervals of successive integers with equal sums of squares#1123888
- Improving bounds for value sets of polynomials over finite fields#1325076
- A set of points with optimal $L^2$ spherical cap discrepancy#1064252
- Prime-power Diophantine tuples#926368
Record · ID 1355240
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