In this paper, if prime p ≡ 3 (mod 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 k as k tends to ⌈log 2 p⌉. As an immediate consequence, it proves that, there exist a constant c such that, the least nonresidue for such primes is at most c⌈log 2 p⌉.