Prime number program in c
C programming language mein prime numbers (sankhya) ko identify karna ek common programming problem hai. Prime number ek aisa positive integer hota hai jo keval 1 aur khud se divisible hota hai, aur kisi aur number se divisible nahi hota. Prime numbers ka example hai: 2, 3, 5, 7, 11, 13, 17, 19, aur aise hi aage jaate hain.
Prime number check karne ke liye ek C program ka example diya gaya hai:
```c
#include
#include
bool isPrime(int num) {
if (num <= 1) {
return false; // 1 aur usse chote numbers prime nahi hote
}
for (int i = 2; i * i <= num; i++) {
if (num % i == 0) {
return false; // num dusre number se divisible hai, isliye prime nahi hai
}
}
return true; // num prime hai
}
int main() {
int num;
printf("Enter a positive integer: ");
scanf("%d", &num);
if (isPrime(num)) {
printf("%d is a prime number.\n", num);
} else {
printf("%d is not a prime number.\n", num);
}
return 0;
}
```
Is program mein, `isPrime` function ek number `num` ko prime check karta hai. Yeh function `for` loop ka istemal karke `num` ke liye 2 se lekar `sqrt(num)` tak ke numbers se divide karke prime check karta hai. Agar kisi bhi number se `num` divisible hota hai, to `isPrime` false return karta hai, aur agar divisible nahi hota hai, to `isPrime` true return karta hai.
Program mein user se ek positive integer input liya jata hai aur uske baad `isPrime` function ka istemal karke check kiya jata hai ki yeh number prime hai ya nahi.
Aap is program ko compile aur run karke prime numbers ko identify kar sakte hain.