Large prime check video

#1

sir,in this video prateek bhaia used a loop if that large no is not in rage of sieve.
and the loop is
for(long long int i=0;primes[i]*(long long)primes[i]<=no;i++)
please tell me how this loop will work in case to check a large number.

#2

this is the classic method we used when we did not know prime sieve
image

#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.