-
Notifications
You must be signed in to change notification settings - Fork 1k
/
Copy pathPrime_Number.go
61 lines (46 loc) · 1.19 KB
/
Prime_Number.go
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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
/* This program checks if a number is a prime number. A number is a
prime number if it has no other factor than 1 and the number itself.*/
package main
import (
"fmt"
"os"
)
// This function checks if a number is a prime number
func is_prime(n int) int {
// Iterate from 2 to number - 1
for i := 2; i < n; i++ {
if(n % i == 0) {
/* If the number is divisible by any of them
then return -1, it is not a prime number.*/
return -1
}
}
// Else return 1, the number is a prime number
return 1
}
func main() {
// Take number as input from the user
fmt.Print("Enter a number to check if it's a prime number: ")
var n int
fmt.Scan(&n)
// If the number is less than equal to 1, exit.
if(n <= 1) {
fmt.Print("The number ", n, " is not a prime number.\n")
os.Exit(0)
}
// Call the function
var result int = is_prime(n)
if(result == 1) {
fmt.Print("\nThe number ", n, " is a prime number.\n")
} else {
fmt.Print("\nThe number ", n, " is not a prime number.\n")
}
}
/* Sample I/O:
a)
Enter a number to check if it's a prime number: 11243
The number 11243 is a prime number.
b)
Enter a number to check if it's a prime number: 12334
The number 12334 is not a prime number.
*/