the formula 1/2(n^2+n) finds the sum of the first n positive integers. find the sum of the first 5 integers, then use the formula to prove you got the same answer. finally use the formula to find the sum f the first 14 integers. answer asap for brainliest worth 30 points.

Induction is done by demonstrating that if the condition is true for some n then it must also be true for n+1. If you then show that the condition is true for n=0 then it must be true for all n>0. For this problem:

Step 1: n=1

The sum of the first 1 odd numbers is 1. 12=1. Therefore the condition holds for n=1.

Step 2: induction

If the sum of the first n odd numbers is n2 then the sum of the first n+1 integers is n2+(2n+1)=(n+1)(n+1)=(n+1)2

So the condition is also true for n+1.

Step 3: conclusion

Since the we have shown that the condition is true for n=1 and we have shown that if it is true for n then it is also true for n+1 then it follows by induction that it is true for all n≥1.

Step-by-step explanation:

sorry if wrong

part a

x     y

0     8

1     7.5

2     7

3     6.5

4     6

5     5.5  

for every hour i deducted .5 inches from the length of the candle

part b

it is a function because for every x value there is only one y value

part   c

for every x value there is only one y value

x       y

0       8

1       7.6

2       7.2

3       6.8

step-by-step explanation:

1. minimum

2. 6400

3. eight

hope this !