Answer:
In programming, a recursive function is a function that calls itself. Recursion is used very commonly in programming, although many simple examples (including some shown in this section) are actually not very efficient and can be replaced by iterative methods (loops or vectorized code in MATLAB).
Step-by-step explanation:
Answer:
p = -2
Step-by-step explanation:
5p - 10 = + 4(1 + 3p)
first get rid of the bracquetes:
5p - 10 = + 4*1 + 4*3p
5p - 10 = + 4 + 12p
subtract left and right of = sign by 5p
5p -5p - 10 = + 4 + 12p -5p
0 - 10 = + 4 + (12p -5p)
subtract left and right of = sign by 4
-10 -4 = 4 -4 + ( 7p )
re arrange
7p + 0 = -14
divide left and right of = sign by 7
7/7 p = -14/7
p = -2
Combine like terms
5) = 4
8) = -5a -12
11) = 4b - 6
hope it helps
