Sumsets being squares

Christian Elsholtz, Andrej Dujella

Research output: Contribution to journalArticlepeer-review

Abstract

Alon, Angel, Benjamini and Lubetzky [1] recently studied an old problem of Euler on sumsets for which all elements of A+B are integer squares. Improving their result we prove:

1. There exists a set A of 3 positive integers and a corresponding set B⊂[0,N] with |B|≫(logN)15/17, such that all elements of A+B are perfect squares.

2. There exists a set A of 3 integers and a corresponding set B⊂[0,N] with |B|≫(logN)9/11, such that all elements of the sets A, B and A+B are perfect squares.

The proofs make use of suitably constructed elliptic curves of high rank.
Original languageEnglish
Pages (from-to)353-357
JournalActa Mathematica Hungarica
Volume141
Issue number4
DOIs
Publication statusPublished - 2013

Fields of Expertise

  • Information, Communication & Computing

Treatment code (Nähere Zuordnung)

  • Basic - Fundamental (Grundlagenforschung)

Fingerprint

Dive into the research topics of 'Sumsets being squares'. Together they form a unique fingerprint.

Cite this