Cacher is the code snippet organizer for pro developers

import java.lang.Math; 

public class integerPrimeMethods {
  
    public static boolean primeTestEasy(int testNum){
      int absTNum = Math.abs(testNum);
      if (absTNum == 0 || absTNum == 1){
          return false;
      }
      int tNumRight = getIntEndSymbol(absTNum);
      if (tNumRight == 2 || tNumRight == 4 || tNumRight == 5 || tNumRight == 6 || tNumRight == 8 || tNumRight == 0){
          return false;
      } 
      double TNumSqRoot  = Math.sqrt(absTNum);
      int i = 3;
      while(i <= (int)TNumSqRoot){
           if (absTNum % i == 0 ) {
              return false;
          }
          i+=2;
      }
      return true;
    }
    
    public static int getIntEndSymbol(int testNum){
      int myDividend = Math.abs(testNum);
      return myDividend % 10;
    } 
}

import java.lang.Math; 

public class integerPrimeMethods {
  
  public static boolean primeTest(long num){
    long n = Math.abs(num);
    if (n == 0 || n == 1){
      return false;
    }
    long e = n % 10;
    if (e == 2 || e == 4 || e == 5 || e == 6 || e == 8 || e == 0){
      return false;
    } 
    double rt = Math.sqrt(n);
    int i = 3;
    while(i <= (int)rt){
      if (n % i == 0 ) {
          return false;
        }
      i+=2;
    }
    return true;
  }
}