Extremal problems for GCDs
We prove that if <i>A</i> ⊆ [<i>X</i>, 2<i>X</i>] and <i>B</i> ⊆ [<i>Y</i>, 2<i>Y</i>] are sets of integers such that gcd (<i>a, b</i>) ≥ <i>D</i> for at least δ |<i>A</i>| |<i>B</i&g...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Cambridge University Press
2021
|