Prime Number | Number Patterns | While Loop | Lecture #64 #cprogramming #coding #c #hindi

# What is a Prime Number?
A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself.

# How to Check if a Number is Prime?
To check if a number is prime, you can use the following steps:

1. *Check if the number is less than or equal to 1*: If the number is less than or equal to 1, it is not prime.
2. *Check if the number has any divisors other than 1 and itself*: You can do this by checking if the number can be divided evenly by any number from 2 to its square root. If it can, then it is not prime.

# Key Concepts
- *Divisor*: A number that divides another number exactly without leaving a remainder.
- *Square root*: A number that, when multiplied by itself, gives the original number.

# Example
Let's say we want to check if the number 25 is prime.

1. *Check if the number is less than or equal to 1*: 25 is greater than 1, so it passes this test.
2. *Check if the number has any divisors other than 1 and itself*: 25 can be divided evenly by 5, so it is not prime.

Therefore, 25 is not a prime number.
#cprogramming #coding #logical #loopstatements #primenumber #hindi #numbersystem #numberpatterns