combinatorics

[cunning quartz]

I tried doing it the traditional way, but i dont think its the correct way to do it

[brave fog]

1. Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
2. Wait patiently for a helper to come along.
3. Once someone helps you, say thank you and close the thread with:

   +close
   

4. Feel free to nominate the person for helper of the week in #helper-nominations
5. Do not ping the mods, unless someone is breaking the rules.
6. If you're happy with the help you got here, and the server overall, you can contribute financially as well:

[fossil vault]

Hint: use the binomial theorem

[cunning quartz]

I came up with this solution

[fossil vault]

yes 2^10 = 1024

[cunning quartz]

Do you have anything that uses up less time/effort?

[fossil vault]

the hint I said lol

[cunning quartz]

How do you come up with 2^10?

[fossil vault]

$\sum_{k=0}^{10}\binom{10}{k}=(1+1)^{10}$ by the binomial theorem

[cerulean storm]

Omegabet_

[cunning quartz]

Ohhh right bc the products on the right are 1

[fossil vault]

yes

[cunning quartz]

Makes sense lol

Thanks man

[lavish spire]

you can have a nice combinatorial proof also :3

[fossil vault]

duh

[lavish spire]

yeah

[fossil vault]

but also.. the question was resolved

[lavish spire]

but like i just like nice combinatorial proof -w-

[fossil vault]

ok

[cunning quartz]

How?

[fossil vault]

count the number of subsets of {1,2,3,...,10}

$\binom{10}{k}$ is the number of subsets with $k$ elements

[cerulean storm]

Omegabet_

[cunning quartz]

+close