Sets whose differences avoid squares modulo m
Number Theory
2022-07-05 v2 Combinatorics
Abstract
We prove that if arbitrarily slowly, then for almost all and any such that does not contain non-zero quadratic residues we have
Cite
@article{arxiv.2007.05774,
title = {Sets whose differences avoid squares modulo m},
author = {Kevin Ford and Mikhail R. Gabdullin},
journal= {arXiv preprint arXiv:2007.05774},
year = {2022}
}
Comments
14 pages