code: def get_nth_prime_bruteforce(n, start_guess=2, start_num_primes=0):
      
      guess = start_guess
      num_primes_found = start_num_primes
      while True:
          if is_prime(guess):
              num_primes_found += 1
          if num_primes_found == n:
              nth_prime = guess
              break
          guess += 1
      return nth_prime
docs: Args:
          n (int): the n-th prime (n=2000 takes about a second)
  
      CommandLine:
          python -m utool.util_alg get_nth_prime_bruteforce --show
  
      Example:
          >>> # DISABLE_DOCTEST
          >>> from utool.util_alg import *  # NOQA
          >>> import utool as ut
          >>> n_list = []
          >>> time_list = []
          >>> for n in range(1, 2000 + 2, 500):
          >>>     with ut.Timer(verbose=0) as t:
          >>>         get_nth_prime_bruteforce(n)
          >>>     time_list += [t.ellapsed]
          >>>     n_list += [n]
          >>> ut.quit_if_noshow()
          >>> import plottool as pt
          >>> pt.multi_plot(n_list, [time_list], xlabel='prime', ylabel='time')
          >>> ut.show_if_requested()