Papers
Topics
Authors
Recent
Search
2000 character limit reached

Vinogradov's Conjecture and Beyond

Published 9 Nov 2021 in math.NT | (2111.05219v2)

Abstract: In this paper, if prime p≡3(mod4)p\equiv 3\pmod 4 is sufficiently large then we prove an upper bound on the number of occurences of any arbitrary pattern of quadratic residues and nonresidues of length kk as kk tends to ⌈log⁡2p⌉\lceil \log_2 p\rceil. As an immediate consequence, it proves that, there exist a constant cc such that, the least nonresidue for such primes is at most c⌈log⁡2p⌉c\lceil \log_2 p\rceil.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.