arXiv (All)
open access
Counting $k$-tuples of positive integers such that the values of several polynomials of $k$ variables are relatively prime
Let $F=(f_1(x_1,\ldots,x_k),\ldots, f_m(x_1,\ldots,x_k))$ be a system of nonconstant polynomials of $k$ variables with integer coefficients and let \[ {\gcd}_F(x_1,\ldots,x_k)= \gcd(f_1(x_1,\ldots,x_k),\ldots, f_m(x_1,\ldots,x_k)). \] We obtain an unconditional asymptotic formula for the sum \[ \sum
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
- Lower bounds for some value sets over finite fields: incidence geometry and Bourgain's group expansion theorem#972703
- Irreducible polynomials with restricted digits in base $b(T)$#1051860
- Deficit bounds and equality cases in the Tu--Deng problem#1122479
- Sums of distinct divisors of factorials#998477
- On subradically sifted sums related to Alladi's higher order duality between prime factors#926969
Record · ID 1064828
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