Skip to main content
2 of 5
texified
Kevin O'Bryant
  • 9.8k
  • 6
  • 57
  • 84

combinatorial problem: how to estimate size of specific subgroup of Z_n

let $A\subset\mathbb{Z}/n\mathbb{Z}$ such that: $|A|>n^{d}$ ($0< d <1$)

$$D=\{(x,y)\,|\, x+y\in A\}$$

and $C=(A\times A)\cap D$. I need to prove (or refute) that there exists a lower bound $u(n)$ such that: $$\lim_{n\rightarrow\infty}\frac{\log(u(n))}{\log(n)}>0$$ and $|C|\geq u(n)|A|$.

thanks to the helpers

elad
  • 21
  • 1