<span>The consecutive sides of the parallelogram are congruent.
</span>
We must find UNIQUE combinations because choosing a,b,c,d... is the same as d,c,b,a...etc. For this type of problem you use the "n choose k" formula...
n!/(k!(n-k)!), n=total number of choices available, k=number of choices made..
In this case:
20!/(10!(20-10)!)
20!/(10!*10!)
184756
11,000 - rounded to the nearest thousand!