I have something like this down:
int f = 120; for(int ff = 1; ff <= f; ff++){ while (f % ff != 0){ }
Is there anything w
Easiest way using recursive function
public static int factorial(int n){ if(n!=1) return n*factorial(n-1); return 1; }