Write a program that figures if a number is prime and what tests would you perform on it.
Sigiloso
public void testPrime () { int num = -1; if (num == 1 || num == 2 ) { System.out.println("The number is prime : " + num ); } int flag = 0; for (int i = 2 ; i < num ; i++) { if (num < 0) { System.out.println("Prime numbers are not positive"); break; } if (num%2 == 0) { flag = 1; break; } } if (flag == 0) { System.out.println("The number is prime : " + num ); } else { System.out.println("The number is not prime : " + num ); } }