L3. Check if a Number if Prime or not | Maths Playlist

[psionl]

You don't need to count the factors. You can exit as soon as you discover a factor (that is not 1 or itself).
for (i = 2; i * i <= n; ++i) {
if ((n % i) == 0) {
return false;
}
}
return true;

[_bajpai]

import math
def isprime(n):
if n<=1:
return False
for i in range(2, int(math.sqrt(n))+1):
if n%i==0:
return False

return True

[massmass]

I'm interested, 😂🖐🏻 and I'm the first one cause of loving code

[diviniixx]

In for loop i should be initialize with 2 not 1 because if you initialize with 1 then it will count 1 as a Prime Number but 1 is not a prime number

[beaware]

Amazing sir another playlist pls keep your next play list on stacks and queues

[ramdangi]

Bhaiya next playlist on string problems please

[manikanta]

Thanks a lot for helping us Bhai <3

[antonioradu]

the 2nd if should be am is in the title

[imran]

♥♥ please make new videos on trees and graphs

[seifyny]

waiting for stacks and queues playlist