*Challenge:* Write a Java program to check if a number is prime or not.
*Input:* Any positive integer (e.g., 29)
*Expected Output:* “29 is a prime number.”
Also, handle edge cases like 0, 1, and negative numbers.
*Java Code (Try to write yourself first):*
import java.util.Scanner;
public class PrimeCheck { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print("Enter a number: "); int num = sc.nextInt();
if (num <= 1) { System.out.println(num + " is not a prime number."); return; }
boolean isPrime = true;
for (int i = 2; i <= Math.sqrt(num); i++) { if (num % i == 0) { isPrime = false; break; } }
if (isPrime) System.out.println(num + " is a prime number."); else System.out.println(num + " is not a prime number."); } }
TechTreakCS
*Java Coding Challenge: Part 1*
*Challenge:* Write a Java program to check if a number is prime or not.
*Input:* Any positive integer (e.g., 29)
*Expected Output:* “29 is a prime number.”
Also, handle edge cases like 0, 1, and negative numbers.
*Java Code (Try to write yourself first):*
import java.util.Scanner;
public class PrimeCheck {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("Enter a number: ");
int num = sc.nextInt();
if (num <= 1) {
System.out.println(num + " is not a prime number.");
return;
}
boolean isPrime = true;
for (int i = 2; i <= Math.sqrt(num); i++) {
if (num % i == 0) {
isPrime = false;
break;
}
}
if (isPrime)
System.out.println(num + " is a prime number.");
else
System.out.println(num + " is not a prime number.");
}
}
*Comment ❤️ for Part-2*
5 months ago | [YT] | 5