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:
500
Step-by-step explanation:
Answer:
Step-by-step explanation:
Here you go mate
Step 1
6+2x<-18 Equation/Question
Step 2
6+2x<-18 Simplify
-24>2x
Step 3
-24/2=2x/2 Divide by 2
answer
x<-12
240,240 is a lot of students for a marching band!
lets use S as a variable for students
s=240/40
240/40
s=6
So there would be 6 students in each row.
Answer: 14 pieces were not eaten.
Step-by-step explanation: 7 pizzas times 8 slices equal 56 slices total. 75% was eaten, leaving 25% or 1/4 not eaten. 1/4 of 56 or 56 divided by 4 is 14.
