Comp Sci A Challenges
Comp Sci A Challenges
if (sumOfFactors == number) {
sumOfPerfectNumbers += number;
}
}
System.out.println(sumOfPerfectNumbers);
}
}
Challenge #2
for (int i = 1; i < 1000; i++) {
if (i % 3 == 0 || i % 5 == 0) {
sum += i;
}
}
System.out.println(sum);
}
}
Challenge #4
System.out.println(largestPrimeFactor);
}
Challenge #5
System.out.println(maxPalindrome);
}
Challenge #6
while (true) {
if (isDivisibleByAll(number)) {
System.out.println(number);
break;
}
number++;
}
}
Challenge #7
System.out.println(sum);
}
}