deletions | additions       diff --git a/Say_there_is_a_3__.tex b/Say_there_is_a_3__.tex  index 5f97c76..5c06032 100644  --- a/Say_there_is_a_3__.tex  +++ b/Say_there_is_a_3__.tex 
...
Say there is a 3 dial combination lock where each dial is completely separate and each contain the numbers 0 through 9. How many possible combinations can be made between the first, second, and third dials?  Before moving forward we should first identify our sets. We will call the first dial's 0 through 9 digits set $A$. We will call the second dial's 0 through 9 digits set $B$. We will call the third dial's 0 through 9 digits set $C$. Are the three sets independent? Yes they are.