diff options
| author | mokha <mokha@cisco.com> | 2019-05-05 19:25:48 -0600 |
|---|---|---|
| committer | mokha <mokha@cisco.com> | 2019-05-05 19:25:48 -0600 |
| commit | 46e409f3ca33ec3c7546d0589301c2a4f967c10a (patch) | |
| tree | 55ed5a3297517719af1856f8fd0fa848dd4b94b5 /src/main/java/ca/mokhan/assignment1/Number.java | |
| parent | c66b9591c81f93e3966050cc7c88981018e9b542 (diff) | |
collapse assignment1 dir
Diffstat (limited to 'src/main/java/ca/mokhan/assignment1/Number.java')
| -rw-r--r-- | src/main/java/ca/mokhan/assignment1/Number.java | 46 |
1 files changed, 46 insertions, 0 deletions
diff --git a/src/main/java/ca/mokhan/assignment1/Number.java b/src/main/java/ca/mokhan/assignment1/Number.java new file mode 100644 index 0000000..d96274f --- /dev/null +++ b/src/main/java/ca/mokhan/assignment1/Number.java @@ -0,0 +1,46 @@ +package ca.mokhan.assignment1; + +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<String> iterate() { + ArrayList<String> items = new ArrayList<String>(); + ArrayList<String> row = new ArrayList<String>(); + 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; + } +} |
