package ca.mokhan.comp268; import java.util.ArrayList; public class Number { public static boolean isDivisibleBy5(int n) { return isDivisibleBy(n, 5); } public static boolean isDivisibleBy7(int n) { return isDivisibleBy(n, 7); } public static boolean isOdd(int n) { return !isDivisibleBy(n, 2); } public static boolean isPrime(int n) { if (n <= 1) return false; for (int i = n - 1; i > 1; i--) if (isDivisibleBy(n, i)) return false; return true; } public static boolean isDivisibleBy(int n, int denominator) { return n % denominator == 0; } public static ArrayList iterate() { ArrayList items = new ArrayList(); ArrayList row = new ArrayList(); for (Integer i = 0; i < 113; i++) { row.clear(); row.add(String.format("%d", i)); if (isOdd(i)) row.add(String.format("%d is odd", i)); if (isDivisibleBy5(i)) row.add("hi five"); if (isDivisibleBy7(i + (i + 1))) row.add("wow"); if (isPrime(i)) row.add("prime"); items.add(String.join(",", row)); } return items; } }