Answer:
The first and last one represents box 5.
24 + 40
4(6) + 4(10) GCF
4(6 + 10) factor
Plz mark me brainliest!
If this is wrong tell me and I will correct!
Hope this helps!
Answer:
C(n) = 4 n for all possible integers n in N. This statement is true when n=1 and proving that the statement is true for n=k when given that statement is true for n= k-1
Step-by-step explanation:
Lets P (n) be the statement
C (n) = 4 n
if n =1
(x+4)n = (x+4)(1)=x+4
As we note that constant term is 4 C(n) = 4
4 n= 4 (1) =4
P(1) is true as C(n) = 4 n
when n=1
Let P (k-1)
C(k-1)=4(k-1)
we need to proof that p(k) is true
C(k) = C(k-1) +1)
=C(k-1)+C(1) x+4)n is linear
=4(k-1)+ C(1) P(k-1) is true
=4 k-4 +4 f(1)=4
=4 k
So p(k) is true
By the principle of mathematical induction, p(n) is true for all positive integers n
<u>ANSWER: </u>
Jack picked 10 ears of corn. The amount of corn left is 
ears of initial corn.
<u>SOLUTION:
</u>
Given, Jack picked 10 ears of corn.
Now the total corn present is 10 ears.
He and two of his sisters ate two each.
Then, remaining corn = 10 ears – eaten corn
= 10 – 2 (by him) – 2 (by his first sister) -2 (by his second sister)
= 10 – 6 = 4
Now, the amount of corn left in fraction is remaining corn divided by initial corn.
Left over corn = 
Hence, the amount of corn left is ears of initial corn.
Answer:
7/5 or 1 2/5
Step-by-step explanation:
I made the proper fractions into improper fractions.
Ex : 3 1/5 as an improper fraction is 16/5
Ex : 1 4/5 as an improper fraction is 9/5
16/5 - 9/5 = 7/5 or 1 2/5
