Checking a Number to be prime or not

 import java.util.*;


public class CalculatePrime {

public static void main(String args[]) {
int i, m = 0, flag = 0;
Scanner sc = new Scanner(System.in);
System.out.println("Enter the number to be checked");
int n = sc.nextInt();
m = n / 2;
if (n == 0 || n == 1) {
System.out.println(n + " is not prime number");
} else {
for (i = 2; i <= m; i++) {
if (n % i == 0) {
System.out.println(n + " is not prime number");
flag = 1;
break;
}
}
if (flag == 0) {
System.out.println(n + " is prime number");
}
} // end of else
}
}

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...