In this problem, why did we precompute the primes seive array as that would take O(NloglogN) time. However if we check from 2 to root(N) it would take O(root(N)) time.
Large Prime check
root(N)>>>NloglogN when n is very very big, that’s why we prefer sieve to calculate this.
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.