Acta Mathematica Hungarica Математика (общая)

On product representations of squares

T. Tao
Springer Nature · 2025-02-01 · DOI 10.1007/s10474-025-01505-7

Аннотация

Abstract Fix $$k \geq 2$$ k ≥ 2 . For any $$N \geq 1$$ N ≥ 1 , let $$F_k(N)$$ F k ( N ) denote the cardinality of the largest subset of $$\{1,\dots,N\}$$ { 1 , ⋯ , N } that does not contain $$k$$ k distinct elements whose product is a square. Erdős, Sárközy, and Sós showed that $$F_2(N) = (\frac{6}{\pi^2}+o(1)) N$$ F 2 ( N ) = ( 6 π 2 + o ( 1 ) ) N , $$F_3(N) = (1-o(1))N$$ F 3 ( N ) = ( 1 - o ( 1 ) ) N , $$F_k(N) \asymp N/\log N$$ F k ( N ) ≍ N / log N for even $$k \geq 4$$ k ≥ 4 , and $$F_k(N) \asymp N$$ F k ( N ) ≍ N for odd $$k \geq 5$$ k ≥ 5 . Erdős then asked whether $$F_k(N) = (1-o(1)) N$$ F k ( N ) = ( 1 - o ( 1 ) ) N for odd $$k \geq 5$$ k ≥ 5 . Using a probabilistic argument, we answer this question in the negative.

Читать у издателя →