Skip to content

Commit 9384c17

Browse files
committed
Add contents to main java
1 parent c440443 commit 9384c17

File tree

1 file changed

+105
-0
lines changed

1 file changed

+105
-0
lines changed

main.java

+105
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,105 @@
1+
// 07:00 remaining
2+
// main.java
3+
// created and
4+
// open in
5+
// intellij
6+
// used chat google and intellij
7+
8+
// 04:45 remaining:
9+
10+
/*
11+
* prompt:
12+
* please give a simple version of a prime checker java file which I can then copy into intellij and there I will use the encapsulate button, where intellij will make it into encapsulated form of the program
13+
*
14+
*
15+
* first answer:
16+
* public class PrimeChecker {
17+
18+
public static void main(String[] args) {
19+
int numberToCheck = 17; // Replace with the number you want to check
20+
boolean isPrime = checkPrime(numberToCheck);
21+
22+
if (isPrime) {
23+
System.out.println(numberToCheck + " is a prime number.");
24+
} else {
25+
System.out.println(numberToCheck + " is not a prime number.");
26+
}
27+
}
28+
29+
public static boolean checkPrime(int number) {
30+
if (number <= 1) {
31+
return false;
32+
}
33+
34+
for (int i = 2; i <= Math.sqrt(number); i++) {
35+
if (number % i == 0) {
36+
return false;
37+
}
38+
}
39+
40+
return true;
41+
}
42+
}
43+
*
44+
* ######################################
45+
*
46+
* second unencapsulated answer from ChatGPT:
47+
*
48+
* prompt:
49+
* please redo with all in main method no separate checkPrime method
50+
*
51+
* result:
52+
*
53+
* public class PrimeChecker {
54+
55+
public static void main(String[] args) {
56+
int numberToCheck = 17; // Replace with the number you want to check
57+
boolean isPrime = true;
58+
59+
if (numberToCheck <= 1) {
60+
isPrime = false;
61+
} else {
62+
for (int i = 2; i <= Math.sqrt(numberToCheck); i++) {
63+
if (numberToCheck % i == 0) {
64+
isPrime = false;
65+
break;
66+
}
67+
}
68+
}
69+
70+
if (isPrime) {
71+
System.out.println(numberToCheck + " is a prime number.");
72+
} else {
73+
System.out.println(numberToCheck + " is not a prime number.");
74+
}
75+
}
76+
}
77+
78+
* now second result as code
79+
* 02:30 remaining:
80+
*/
81+
public class PrimeChecker {
82+
83+
public static void main(String[] args) {
84+
int numberToCheck = 17; // Replace with the number you want to check
85+
boolean isPrime = true;
86+
87+
if (numberToCheck <= 1) {
88+
isPrime = false;
89+
} else {
90+
for (int i = 2; i <= Math.sqrt(numberToCheck); i++) {
91+
if (numberToCheck % i == 0) {
92+
isPrime = false;
93+
break;
94+
}
95+
}
96+
}
97+
98+
if (isPrime) {
99+
System.out.println(numberToCheck + " is a prime number.");
100+
} else {
101+
System.out.println(numberToCheck + " is not a prime number.");
102+
}
103+
}
104+
}
105+

0 commit comments

Comments
 (0)