cs230 Lecture Notes Week 2, Monday Homework 0 due today. Face-to-face grading in lab tomorrow. Before lab, read Chapter 8 and hw01, and the documentation of the BigInteger class. For next time, read Chapters 8 and 9 and prepare for a quiz. Quiz 1 Solution --------------- Write a class method named areFactors that takes an integer n and an array of integers, and that returns true if the numbers in the array are all factors of n (which is to say that n is divisible by all of them). Algorithm: traverse the array. If we find an element that doesn't divide n, we can return false immediately. If we get all the way through the array without finding a clinker, then we can return true. public static boolean areFactors (int n, int[] array) { for (int i=0; i