Top suggestions for qs. print if a number n is prime or not (input n from the user). [in this problem you will learn how to check if a number is prime or not] import java.util.*; public class solutions { public static void main(string args[]) { scanner sc = new scanner(system.in); int n = sc.nextint(); boolean isprime = true; for(int i=2; i<=n/2; i++) { if(n % i == 0) { isprime = false; break; } } if(isprime) { if(n == 1) { system.out.println("this is neither prime not composite"); } else { system.out.println("this is a prime number"); } } else { system.out.println("this is not a prime number"); } } } |