Skip to content
Home
Problems
Updates
Vela Mathematics Program
/
Problems
/
43
Search or jump
⌘K
Overview
Problem ledger
Claims
Proposed changes
Commits
Reproduce
Problem
erdos:43
If Sidon sets
A
,
B
⊆
{
1
,
…
,
N
}
A, B \subseteq \{1, \dots, N\}
satisfy
(
A
−
A
)
∩
(
B
−
B
)
=
{
0
}
(A-A) \cap (B-B) = \{0\}
, must
(
∣
A
∣
2
)
+
(
∣
B
∣
2
)
≤
(
f
(
N
)
2
)
+
O
(
1
)
\binom{|A|}{2} + \binom{|B|}{2} \le \binom{f(N)}{2} + O(1)
, where
f
(
N
)
f(N)
is the largest Sidon-set size in
[
N
]
[N]
- and can the bound be improved by a fixed proportion when
∣
A
∣
=
∣
B
∣
|A| = |B|
?
Open Current State
Declared status
disproved
Formalization
formalized
Prize
$100
Subjects
number theory
·
sidon sets
·
additive combinatorics
OEIS
A143824 · A227590 · A003022 · possible
Sources
source:erdos-ai-contributions-wiki
·
source:erdos-problems
·
source:formal-conjectures
·
source:vibemathed
Statement
www.erdosproblems.com
Matching claims
0
No direct claims
This problem has no directly related claim record.
Browse this Repository’s Claims