-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprime_num(b).c
More file actions
36 lines (31 loc) · 813 Bytes
/
prime_num(b).c
File metadata and controls
36 lines (31 loc) · 813 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
/*Q; prime number in range.*/
#include <stdio.h>
// define a function for calculation of prime number
int prime_num(int n) {
if(n<=1) {
return 0; // For negative number
}
for (int i = 2; i * i <= n; i++) {
if (n%i==0) {
return 0;
}
}
return 1;
}
int main() {
int low_n;
int upper_n;
// Ask to user enter the lower number
printf("Enter lower number: ");
scanf("%d", &low_n);
// Ask to user enter the upper number
printf("Enter upper number: ");
scanf("%d", &upper_n);
// range of low_n to upper_n
printf("The prime number from %d to %d. \n", low_n, upper_n);
for (int i = low_n; low_n <= upper_n; low_n++) {
if(prime_num(low_n)) {
printf("%d \n", low_n);
}
}
}