+633 Hello, sorry if this comes out looking weird, but side note, I'm only able to make questions in the source code editor atm :P
Anyways I was thinking about a problem recently that I remembered had a pretty cool solution, but I can't remember what it is. I've ended up wishing I knew about the solution too many times now so I hope that by asking about it I'll not forget it.
The question: Suppose you had six different integers, ranging from zero to thirty-one (inclusive). How might one calculate the number of possible values for those variables such that they might add up to a particular value? (this would be using permutations)
To work through this, I think starting with the number 93 would be helpful, as it's right in the middle of the possible range of values.
Part two of my question might be too advanced for me, but I'd like to see if it has a simple solution anyways.
How many different permutations of integers zero through thirty-one (inclusive) are there that have a sum greater than 104?
I know some people might want to just give the answer and show the end steps, but I would like to know about the method to get the answer, not just the answer itself!
Thanks in advance!
Side note for the admin, I'm using the latest chrome version and haven't tried relaunching the browser yet, but a refresh didn't fix the issue. Nothing weird in the console history, but I hope you might look into this.
