Finding prime number using square root method

 import java.util.*;


public class PrintPrimeNo{
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
System.out.println("Enter a number");
int n = sc.nextInt();
test_No(n);

}

public static void test_No(int n){
int flag=0;
if(n==0 || n==1){
System.out.println("This is not a prime number");
} else{
for(int i=2;i<=(int)Math.sqrt(n);i++){
if(n%1==0){
System.out.println("This is not a prime number");
flag=1;
break;
}
}
}
if(flag ==0){
System.out.println("This is a prime number");
}
}
}

Google Script for Data Entry Form in Google Spreadsheet

// function to validate the entry made by user in user form function validateEntry (){ // declare a variable and referernece of active goog...