F Nous contacter


0

Documents  05A18 | enregistrements trouvés : 1

O
     

-A +A

Sélection courante (0) : Tout sélectionner / Tout déselectionner

P Q

Erdös and Sárközy asked the maximum size of a subset of the first $N$ integers with no two elements adding up to a perfect square. In this talk we prove that the tight answer is $\frac{11}{32}N$ for sufficiently large $N$. We are going to prove some stability results also. This is joint work with Simao Herdade and Ayman Khalfallah.

05A18 ; 11B75

Nuage de mots clefs ici

Z