Deepak and Primes

#1

I am not able to understand what I have to do in this question.

#2

Hi Harshul,
In this we use the concept of sieve of eratosthenes which you must have studied in course lectures.
steps to follow :

  1. Find the prime numbers upto some MAX_SIZE using Sieve of Eratosthenes.
    2 .Store all primes in a vector.
  2. For a given number N, return element at (N-1)th index in a vector.
#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.