Create function is_prinme(n), in which n is an integer larger than 1. The function returns True if n is a prime number, otherwise, it returns False.
- A simple method of checking the primality of a giver numver n, called trial division, tests whether n is divisible by any integer between 2 and root n.
Hints:
1.May use(x%y==0) to check if x is divisible by y.
- May consider using the functions of the math module, such as sqrt(), ceil(), floor() .etc
Example:
is_prime(3) =>True
is_prime(6) => False