Doubt about check prime

#1

Scanner scn = new Scanner(System.in);
int n= scn.nextInt();
if(n>2 && n<=1000000000) {

    int divisor= 2;
	boolean flag =true;
	
	while(divisor<=n-1) {
		if (n%divisor==0 ) {
			 flag = false;
		}
		divisor=divisor+1;
	}
	if(flag==true) {
		System.out.println("prime");
	}
	else {
		System.out.println("non-prime");
	}
}
#2

hey @harsh.hj
remove this line if(n>2 && n<=1000000000) {//redundant condition
just a change
if(flag==true) {
System.out.println(“Prime”);
}
else {
System.out.println(“Not Prime”);
}

import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner scn = new Scanner(System.in);
int n= scn.nextInt();
// if(n>2 && n<=1000000000) {

int divisor= 2;
boolean flag =true;

while(divisor<=n-1) {
	if (n%divisor==0 ) {
		 flag = false;
	}
	divisor=divisor+1;
}
if(flag==true) {
	System.out.println("Prime");
}
else {
	System.out.println("Not Prime");
}

}

}
#3

its done sir I have submitted the code

#4

@harsh.hj Please mark your doubts as resolved in your course’s.