If I have a bucket of 10 unique objects and I pick out 3 samples.

What I'm really asking is what's the best/quickest way to go about solving this?

If you are looking for the total amount of unique sets with out regard for order, then yes, you divide by 6. This is known as a combination, instead of a permutation, which depends on order as well.

https://en.m.wikipedia.org/wiki/Combination

10 choose 3 = [math]10 \choose 3[/math] = 120

Look up " probability and combinatorics"

https://www.mathsisfun.com/combinatorics/combinations-permutations.html


Best

>>7952785
[eqn]\frac{10!}{(10! - 3!)3!} = 120[/eqn] FTFY

>>7952772
>no traps
>no triceps

fucking curlbro assassin

>>7952831
except it's (10-3)! and not (10!-3!)

so actually you didn't fix anything, you just ruined something

>>7952852
Still outputted 120 m9