public class Rekursjon {

    public static void main(String[] args) {

        System.out.println(factorial(5));

        System.out.println(sumNumbs(6));
        //System.out.println(factorialBroken(1));
    }

    static int factorial (int n) {
        if (n <= 1) return 1;
    
        return n*factorial(n-1);
    }


    static int factorialBroken(int n) {
        return n * factorialBroken(n+1);
    }


    static int sumNumbs(int n) {
        if (n <= 1) return 1;
        return n + (sumNumbs(n-1));
    }
}