Akansha Yadav builds a Python function to check if a number is prime. Instead of checking divisors up to the square root, she uses num raised to the power of 0.55 as a faster shortcut, then tests it with the number 10.
Let's write a Python program to check if the given number is prime number or not. So here I am on Replit creating a function is_prime, passing num as an argument. Then I am trying to check whether the number is less than 2 or not. If it is, then return false. And then I am trying to iterate it with the condition num to the power of 0.55. So here I am checking whether the num is divisible by the i value of for loop. If yes, then return false. Else return true. So here I am checking 10 is
