arXiv (All)
open access
Solutions of $x_1^2+x_2^2-x_3^2=n^2$ with small $x_3$, revisited
Let $r(N)$ be the number of representations of $N$ as a sum of two squares. For every integer $n\ge 2$ we prove an asymptotic formula for $\sum_{x\equiv e \bmod 2}Φ(x/M)\,r(n^2+x^2)$, that is, for the number of integral solutions of $x_1^2+x_2^2-x_3^2=n^2$ with $x_3\equiv e \bmod 2$ in a range $|x_3
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
- The existence of small defining polynomials for number fields#1355517
- Exceptional points on Atkin--Lehner quotients#819960
- An upper bound for valuations of elliptic nets at primes of bad reduction#1355202
- Resolving a conjecture on permutation polynomials over $\mathbb{F}_{2^n}$#926281
- Product representations of polynomials over finite fields#1063833
Record · ID 1355851
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