ArrayList primfaktoren(long n) { ArrayList faktoren = new ArrayList(); long z = n; while (z > 1) { long p = kleinsterPrimfaktor(z); faktoren.add(p); z = z / p; } return faktoren; } long kleinsterPrimfaktor(long n) { for (long p = 2; p <= sqrt(n); p++) { if (n % p == 0) return p; } return n; } void setup() { long[] numbers = new long[] { 11, 42, 48, 51, 100, 101, 221, 585, 1009, 10007 }; for (long number : numbers) { println(number, primfaktoren(number)); } } void draw() { }