import java.util.*; public class Program { /* * from kiuziu 2019 * a nice vatiety of static methods. At the * main method you find some examples how * the methods works. please play around to * understand the workflow. * This are only a part of my tools. */ public static void main(String[] args) { System.out.println("Examples"); System.out.println(repeat("~-",20)); System.out.println("GCD of 55 66 88 99 is " + gcd(55,66,88,99)); // other way same result: int[] n = {55,66,88,99}; Integer[] ni = {55,66,88,99}; System.out.println("GCD of the array {55, 66, 88, 99} is " + gcd(n)); System.out.println(repeat("..",20)); System.out.println("if 997 prime? " + isPrime(997)); long x = 123; System.out.printf("the prime factors of %s are %s%n", x, pfz(x)); x = 239_378_649_510L; System.out.printf("the prime factors of %s are %s%n",x ,pfz(x)); System.out.println(repeat("..",20)); System.out.println("Example for method randomOfAny"); System.out.println("don't works because the n array\ndata typs are primitive: " + randomOfAny(n)); System.out.println(repeat("..",20)); System.out.println("with wrapper class works fin: " + randomOfAny(ni)); System.out.println(repeat("..",20)); System.out.println("example of the divid-method with 50 decimal places (5/7): \n" + divid(5, 7, 50)); System.out.println(repeat("..",20)); System.out.println("example of the divid-method with 15 decimal places (19/97): \n" + divid(19, 97, 15)); } /** * this method check the given input * number is a prime number. * PARAMETER a Long type number. * RETURN true if the parameter is a prime * number else return false. */ public static boolean isPrime(long number){ if(number == 2 || number == 3) return true; if(number < 2 || number % 2 == 0) return false; for(long i = 3; i <= Math.sqrt(number); i += 2){ if(number % i == 0) return false; } return true; } /** * Greatest Common Divisor of the given * Integers. * PARMETER 2 or more Integers or an Array * of Integers * RETURN the GCD as an Integer */ public static int gcd(int... n){ if(n == null || n.length < 1) return 0; int length = n.length - 1; int a = n[length]; while (length >= 0){ int b = n[length--]; a = getGCD(a, b); } return a; } // this method is necessary for the gcd // method above. private static int getGCD(int a, int b){ if(a == 0 || b == 0) return a == 0 ? b : a; while(a != b){ if(a < b) b -= a; if(a > b) a -= b; } return a; } /** * a method for Prime Factorization from * an number input. * PARMETER an Long value. * RETURN an ArrayList of Long with all * Prime factors of that input number. */ public static ArrayList pfz(long number){ ArrayList factors = new ArrayList<>(); long reminder = number; long divisor = 2; while(reminder >= divisor){ if(reminder % divisor == 0){ factors.add(divisor); reminder /= divisor; }else{ divisor++; } } return factors; } /** * this method repeat the given String s * and return the result. * PARAMETER a String that will repeated * and an int 'times'. how many times are * the String repeats. * RETURN the result String with the * repeated String s. */ public static String repeat(String s, int times){ String result = ""; for(int i = 0; i < times; i++){ result += s; } return result; } /** * this method returns a randomly element * of the given array. * the method don't works with primitive * data types because generics are used. * for more information please refer the * oracle tutorials. * for primitive data types use the * wrapper classes. * PARAMETER an array non primitive data * type. * RETURN a randomly choose element of * the given array. */ public static T randomOfAny(T... array){ int x = (int)(Math.random() * array.length); return array[x]; } /** * The Integer Factorial method with such many decimal places are you want * The result are not rounded. * @param numerator * @param denominator * @param maxDigits many decimal places are you want * @return the result is a Decimal Number as a String */ public static String divid(int numerator, int denominator, int maxDigits) { if(denominator == 0) throw new ArithmeticException("division by zero not allowed."); if(numerator == 0) return "0"; int count = 0; int z = numerator; int n = denominator; String fraction = ""; do { int x = z / n; fraction += "" + x; if(!fraction.contains(".")) fraction += "."; z = z % n; if (z == 0) return delLastPoint(fraction); z *= 10; } while (count++ < maxDigits); return fraction; } /* * this method is necessary for the divid method */ private static String delLastPoint(String fraction) { if(fraction.endsWith(".")) return fraction.substring(0, fraction.length()-1); return fraction; } }

kiuziusTools