Answer:
Tiger Algebra{(2a-b)^3+(a-2b)^3} - Free yet powerful Solver Simplifier that ... Step 2 : Pulling out like terms : 2.1 Pull out like factors : 9a3 - 18a2b + 18ab2 - 9b3 =Step-by-step
explanation:
G(5) for the sequence g = <span>{(6,3), (-4,2), (5,0)} is 0</span>
Answer: 1) 5040 and 2) 165
Step-by-step explanation:
1) Here total number of letters = 10
The number of permutations that can be formed using 4 letters at a time
= P (10, 4)
= 
= 
= 
= 
= 10 × 9 × 8 × 7
= 5040
2) Here the total number of machine = 11
The different combinations of machines can Geoff choose from to use
= 
= 
= 
= 
= 11 × 5 × 3
= 165