Abstract
We study the second order analogue of the problem of finding optimal lower and upper bounds for the length of sequences of squares in arithmetic progression modulo a prime, and some connections with the computational problem of finding a quadratic non-residue modulo a prime. More precisely, we work modulo an integer and our objects of study are those sequences of squares whose the second difference is an invertible constant. The main results of our work is a number of exact formulae that allow to reduce the problem to prime moduli. We also observe several phenomena which are supported by extensive numerical computations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
