Imagine this represents how many combinations you can have for each of the 4 wheels (each blank spot for one wheel): __ __ __ __
For the first situation it says how many combos can we make if no digits are repeated. We have 10 digits to use for the first wheel so put a 10 in the first slot 10 __ __ __ Since no digit can be repeated we only have 9 options for the second slot 10 9_ __ __ Same for the third slot, so only 8 options <u>10</u> <u> 9 </u> <u> 8 </u> __ 4th can't be repeated so only 7 options left <u>10</u> <u> 9 </u> <u> 8 </u> <u> 7 </u><u> </u>Multiply the four numbers together: 10*9*8*7 = 5040 combinations
For the next two do the same process as the one above.
If digits can be repeated? You have ten options for every wheel so it would look like this: <u>10</u> <u>10</u> <u>10</u> <u>10 </u> 10*10*10*10 = 10,000 combinations
If successive digits bust be different? We have 10 for the first wheel, but second wheel only has 9 options because 2nd number can't be same as first. The third and fourth wheels also has 9 options for the same reason.
To solve a pair of equations using substitution, first solve one of the equations for one of the variables. Then substitute the result for that variable in the other equation.
Choose one of the equations and solve it for x by isolating x on the left-hand side of the equal sign. I'm choosing the 1st equation for now.
Add 5y to both sides of the equation.
Divide both sides by 2.
Multiply times 5y - 13.
Substitute for x in the other equation, 3x + 4y = 15.
Multiply 3 times .
Add to 4y.
Add to both sides of the equation.
Divide both sides of the equation by 23/2, which is the same as multiplying both sides by the reciprocal of the fraction.
Substitute 3 for y in . Because the resulting equation contains only one variable, you can solve for x directly.
Multiply 5/2 times 3.
Add to by finding a common denominator and adding the numerators. Then reduce the fraction to its lowest terms if possible.
The system is now solved. The value of x & y will be 1 & 3 respectively.