-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathprimesV2-outputExamples.txt
87 lines (79 loc) · 2.31 KB
/
primesV2-outputExamples.txt
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
Output linux executable compiled from the c++ code:
--$ ./primesV2
Enter the number of digits: 2
Finding highest prime...
Highest prime: 97
Finding lower primes...
Lower primes: [02, 03, 05, 07, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89]
Checking for Sophie Germain and safe primes...
2 is a Sophie Germain prime
3 is a Sophie Germain prime
5 is a Sophie Germain prime and a safe prime
7 is a safe prime
11 is a Sophie Germain prime and a safe prime
13
17
19
23 is a Sophie Germain prime and a safe prime
29 is a Sophie Germain prime
31
37
41 is a Sophie Germain prime
43
47 is a safe prime
53 is a Sophie Germain prime
59 is a safe prime
61
67
71
73
79
83 is a Sophie Germain prime and a safe prime
89 is a Sophie Germain prime
Output python code:
--$ python3 primesV2.py
Enter the number of digits: 2
Highest prime: 97
Lower primes: ['02', '03', '05', '07', '11', '13', '17', '19', '23', '29', '31', '37', '41', '43', '47', '53', '59', '61', '67', '71', '73', '79', '83', '89']
Checking for Sophie Germain and safe primes...
02 is a Sophie Germain prime
03 is a Sophie Germain prime
05 is a Sophie Germain prime
11 is a Sophie Germain prime
23 is a Sophie Germain prime
29 is a Sophie Germain prime
41 is a Sophie Germain prime
53 is a Sophie Germain prime
83 is a Sophie Germain prime
89 is a Sophie Germain prime
02 is a Sophie GermainSafe prime
03 is a Sophie GermainSafe prime
05 is a Sophie GermainSafe prime
11 is a Sophie GermainSafe prime
23 is a Sophie GermainSafe prime
29 is a Sophie GermainSafe prime
41 is a Sophie GermainSafe prime
53 is a Sophie GermainSafe prime
83 is a Sophie GermainSafe prime
89 is a Sophie GermainSafe prime
And output Java code:
java primesV2.java
Enter the number of digits: 2
Finding highest prime...
Highest prime: 97
Finding lower primes...
Lower primes: [02, 03, 05, 07, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89]
Checking for Sophie Germain and safe primes...
2 is a Sophie Germain prime
3 is a Sophie Germain prime
5 is a Sophie Germain and safe prime
7 is a safe prime
11 is a Sophie Germain and safe prime
23 is a Sophie Germain and safe prime
29 is a Sophie Germain prime
41 is a Sophie Germain prime
47 is a safe prime
53 is a Sophie Germain prime
59 is a safe prime
83 is a Sophie Germain and safe prime
89 is a Sophie Germain prime