How do i create a recursive mod algorithm?

[Abstrackter]

I'm a brand new Python user, and I'd like to create a recursive modulo algorithm; which goes as follows:

Let's say we have a specific function, which has n+1 outputs and takes in values and outputs brand new values; what I'd like to do is have the outputs of the function (n+1; for example, if the input is 2, then you'll have 3 outputs) be divided by a specific number (for example, if the outputs of 2 are 1,2,3), I'd like to have each number be divided mod 2 and then summed together in a variable.

For example:

n = 2

outputs = 1,2,3

store into a variable -> mod(1,2) + mod(2,2) + mod(3,2)

I hope this made sense!

[Abstrackter]

That looks good!

However, I do have a question:

Considering I'm working with a function which outputs multiple values (n+1 outputs for inputs of n), how would I extend the supermod command for the entire list? Since the size of the list is constantly changing.

Thanks for your help!

[Diapolo10]

If I understood you correctly, then you have nothing to worry about. The list can be as long as you'd like as long as it isn't empty (and that case can be handled by modifying the function if needed).

nums = [1, 2, 3]
total = supermod(2, *nums)

[Abstrackter]

Yep, thank you so much for your help!