Sums Involving Common Divisors (Q3737519)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3970860
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sums Involving Common Divisors |
scientific article; zbMATH DE number 3970860 |
Statements
Sums Involving Common Divisors (English)
0 references
1986
0 references
sums of greatest common divisors
0 references
diophantine inequality
0 references
number of solutions
0 references
0.7914426326751709
0 references
0.7539485096931458
0 references
0.7495698928833008
0 references
0.7479515671730042
0 references
The authors give a uniform upper bound for the sum \[ (*)\quad \sum_{1\leq r,s\leq k}(\frac{f(r) g(s) (a_ r,a_ s)^ 2}{a_ r a_ s})^{1/2}, \] where \(\{a_ k\}\) is an arbitrary sequence of distinct positive integers and f and g are arbitrary non-negative functions. Sums of this type arise in certain diophantine problems; in fact the authors establish here a bound for the number of solutions of the system \[ ma_ r=nb_ s,\quad 1\leq m\leq M,\quad 1\leq n\leq N,\quad 1\leq r\leq R,\quad 1\leq s\leq S, \] where \(\{a_ r\}\) and \(\{b_ s\}\) are arbitrary sequences of distinct positive integers that is essentially equivalent to their bound for (*). An application of these results to the metric theory of diophantine approximation is announced in the paper; this has appeared in the meantime [the second author, Math. Proc. Camb. Philos. Soc. 99, 385-394 (1986; see the following review)]. [Note: There is a misprint in the statement of Theorem \(1: (a_ r,a_ s)\) should be replaced by \((a_ r,a_ s)^ 2.]\)
0 references