Skip to content

Erdős problem 331

Let A,BNA,B\subseteq \mathbb{N} such that for all large NNA{1,,N}N1/2\lvert A\cap \{1,\ldots,N\}\rvert \gg N^{1/2}andB{1,,N}N1/2.\lvert B\cap \{1,\ldots,N\}\rvert \gg N^{1/2}. Is it true that there are infinitely many solutions to a1a2=b1b20a_1-a_2=b_1-b_2\neq 0 with a1,a2Aa_1,a_2\in A and b1,b2Bb_1,b_2\in B?

Sources

Browse retained paths and inspect the exact material available for this Problem.

2 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

331.lean

Retained formal statement2 of 2

Ruzsa suggests that a non-trivial variant of this problem arises if one imposes the stronger condition that A{1,,N}cAN1/2|A \cap \{1,\dots,N\}| \sim c_A N^{1/2} for some constant cA>0c_A>0, and similarly for BB.

FormalConjectures/ErdosProblems/331.leanErdos331.erdos_331.variants.ruzsa5 linesExact file
True  ∀ (A B : Set ℕ),    (∃ c_A > 0, Asymptotics.IsEquivalent Filter.atTop (fun n => ↑(Nat.count A n)) fun n => c_A * ↑n ^ (1 / 2)) →      (∃ c_B > 0, Asymptotics.IsEquivalent Filter.atTop (fun n => ↑(Nat.count B n)) fun n => c_B * ↑n ^ (1 / 2)) →        {(a₁, a₂, b₁, b₂) | a₁ ∈ Aa₂ ∈ Ab₁ ∈ Bb₂ ∈ Ba₁ ≠ a₂ ∧ a₁ + b₂ = a₂ + b₁}.Infinite
OpenStatement only, no proof

Search problems.science

Find a Problem, Result, source, or page