Every programmer comes across the problem of checking whether a number is prime and indeed it’s one of the basic level program in any language. I also tried it in many different languages, but the best language that I found to implement it is Python. It’s just one single line and the program does it all. Its so simple and smooth than other languages.

The concept of Any and All has really reduced this problem to a single line and yes it is fast too.

The logic used in this program is based on school method to check prime.

`# Returns true if n is prime else false ` `def` `prime(n): ` ` ` `return` `all` `([(n ` `%` `j) ` `for` `j ` `in` `range` `(` `2` `, ` `int` `(n` `*` `*` `0.5` `)` `+` `1` `)]) ` `and` `n>` `1` ` ` `# Driver code ` `n ` `=` `41` `if` `prime(n): ` ` ` `print` `(` `"Yes"` `) ` `else` `: ` ` ` `print` `(` `"No"` `) ` |

*chevron_right*

*filter_none*

Yes

This article is contributed by **Chinmoy Lenka**. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

## Recommended Posts:

- Python | sympy.prime() method
- Prime functions in Python SymPy
- Print the nearest prime number formed by adding prime numbers to N
- Check if a number is Prime, Semi-Prime or Composite for very large numbers
- Count occurrences of a prime number in the prime factorization of every element from the given range
- Python program to check whether a number is Prime or not
- Permutation of first N positive integers such that prime numbers are at prime indices | Set 2
- Permutation of first N positive integers such that prime numbers are at prime indices
- Quick ways to check for Prime and find next Prime in Java
- Python program to print all Prime numbers in an Interval
- Analysis of Different Methods to find Prime Number in Python
- Check if a prime number can be expressed as sum of two Prime Numbers
- Count all prime numbers in a given range whose sum of digits is also prime
- Print prime numbers with prime sum of digits in an array
- Find coordinates of a prime number in a Prime Spiral
- Check whether the sum of prime elements of the array is prime or not
- Sum of prime numbers without odd prime digits
- Absolute difference between the Product of Non-Prime numbers and Prime numbers of an Array
- Absolute difference between the XOR of Non-Prime numbers and Prime numbers of an Array
- Print all numbers whose set of prime factors is a subset of the set of the prime factors of X