Finding The nth Prime such that the prime - 1 is divisible by n
05AB1E, 9 8 bytes

05AB1E uses CP-1252 encoding.

Saved a byte thanks to Osable

µN¹*&gt;Dp½


Try it online!

Explanation

µ          # for N in [1 ...] loop until counter == input
 N¹*&gt;      # N*input+1 (generate multiples of input and increment)
     D     # duplicate
      p½   # if prime, increase counter
           # implicitly output last prime