Answer:
2/5x
Step-by-step explanation:
[character limit thing]
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
Answer:
Nina must drive 32.55 more miles.
Answer:
BE = 49
Step-by-step explanation:
In triangle BDC
65^2=56^2+BD^2
65^2-56^2=BD^2
4225-3136=BD^2
1089=BD^2
33=BD
In triangle FDE
65^2=63^2+DE^2
4225-3969=DE^2
256 = DE^2
16=DE
since ED+DB=BE
THEREFORE
16+33=BE
49=BE
