If the numbers 4, 5 and 6 are each used exactly once to replace the letters in the expression $A ( B - C )$, what is the least possible result?
Question:
If the numbers 4, 5 and 6 are each used exactly once to replace the letters in the expression $A ( B - C )$, what is the least possible result?
Answer:
Let's think step by step.

user
-10
If the numbers 4, 5 and 6 are each used exactly once to replace the letters in the expression $A ( B - C )$, what is the least possible result?
train