3/6 look at the pic to understand
Answer:
If p is the smallest of n consecutive integers of the same sign than we have p , p+1 , p+2 , … , p+(n−1) ,
So the sum is
∑k=0n−1(p+k)=∑k=0n−1p+∑k=0n−1k=np+n2−n2
Here n=4
So we have 4p+6
And checking
p+(p+1)+(p+2)+(p+3)=4p+6
Note if p=−v
Than you have the same thing as if p=v−n+1 just negative for example 3 consecutive integers the smallest is −5 so the sum is −5+(−4)+(−3)=3×−5+32−32=−15+3=−12
On the other hand:
−(3+4+5)=−(3×3+32−32)=−(9+3)=−12
If p=−v the sum of next v+1 integers is −(∑k=0vk)=−(v2+v2)
Than needs an other v integers to bring it up to 0 again. From there it is
∑k=0hk=h2+h2
Where h=n−(2v+1) .
So recap if p is the smallest of n consecutive integers their sum is
p+(p+1)+(p+2)+…+(p+(n−1))=⎧⎩⎨⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪np+n2+n2−(n|p|+n2+n2)((n−|p|)2+(n−|p|)2)−(|p|p+|p|2+|p|2)((n−|p|)2+(n−|p|)2)n≥0p<0∧n<|p|+1p<0∧|p|<n<2|p|+1p<0∧n>2|p|+1
Step-by-step explanation:
The graph that matches the given equation is y≥x-1 is Graph A.
Option: C.
<u>Step-by-step explanation:</u>
The given equation y≥x-1 is a linear inequality equation.
Graphing Linear Inequalities differs from graphing regular linear equations. That is it has certain rules to be followed to draw the graph.
- First, rearrange the equation as y in the left and other terms in the opposite side.
- Check for the line: y= , y≤ and y≥ comes with straight line where as y< and y> comes with a dotted line.
- Shading: If y> greater than or y≥ greater than or equal is present then the space above the line has to be shaded. If y< less than or y≤ less than or equal is present then the space below the line has to be shaded.
For the given equation y≥x-1,
The line will be solid passing through (0,-1) and (3,2) since it has y≥. Also, the region above the line is shaded.
So the graph A is the graph that matches the equation y≥x-1.
Answer:
The answer is "d" x= r-p / g
Step-by-step explanation:
First let's get rid of the "p" term on the left-side. After you've done that, you have to get rid of the g term. So you divide the x term by the g-term, you do this to both sides.
4!=4*3*2*1=24
11!=11*10*9*8*7*6*5*4*3*2*1=39916800
7!=7*6*5*4*3*2*1=5040
n choose k
how many ways are there to choose k rollercoasters from n choices?

=


=

=

=

=

=330
330 ways