1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
finlep [7]
3 years ago
7

The closed form sum of

Mathematics
1 answer:
zalisa [80]3 years ago
4 0

Perhaps you know that

S_2 = \displaystyle\sum_{k=1}^n k^2 = \frac{n(n+1)(2n+1)}6

and

S_3 = \displaystyle\sum_{k=1}^n k^3 = \frac{n^2(n+1)^2}4

Then the problem is trivial, since

\displaystyle\sum_{k=1}^n k^2(k+1) = S_2 + S_3 \\\\ = \frac{2n(n+1)(2n+1)+3n^2(n+1)^2}{12} \\\\ = \frac{n(n+1)\big((2(2n+1)+3n(n+1)\big)}{12} \\\\ = \frac{n(n+1)\big(4n+2+3n^2+3n\big)}{12} \\\\ = \frac{n(n+1)(3n^2+7n+2)}{12} \\\\ = \frac{n(n+1)(3n+1)(n+2)}{12}

Then

12\bigg(1^2\cdot2+2^2\cdot3+3^2\cdot4+\cdots+n^2(n+1)\bigg) = n(n+1)(n+2)(3n+1)

so that <em>a</em> = 3 and <em>b</em> = 1.

You might be interested in
The sum of a number and 7 is the same as double the number increased by 3
koban [17]
So, let’s represent the number as n:
n+7=2n+3
Subtract both sides by 3:
n+4=2n
Now by n:
2n=4
Divide:
n=2
The number is 2
4 0
3 years ago
Read 2 more answers
Bir işi 5 işçi 8 günde bitirdi aynı işi 4 işci kac gunde bitirir​
Aleonysh [2.5K]

tam olmasada yaklaşık 6.5 günde bitter

8 0
3 years ago
Consider a deck with 2626 black and 2626 red cards. You draw one card at a time and you can choose either guess on whether it is
gregori [183]

The maximum earning is v(r,b)

Let v(r,b) be the expected value of the game for the player, assuming optimal play, if the remaining deck has r red cards and b black cards.

Then v(r,b) satisfies the recursion

and

The stopping rule is simple: Stop when v(r,b)=0.

To explain the recursion . . .

If r,b>0, and the player elects to play a card, then:

  • The revealed card is red with probability \frac{r}{r+b}, and in that case, the player gets a score of +1, and the new value is V(r-1,b)
  • The revealed card is black with probability \frac{b}{r+b}, and in that case, the player gets a score of −1, and the new value is V(r,b-1)

Thus, if r,b>0, electing to play a card yields the value f(r,b).

But the player always has the option to quit, hence, if r,b>0, we get v(r,b)=max(0,f(r,b)).

Implementing the recursion in Maple, the value of the game is

v(26,26)=41984711742427/15997372030584

v(26,26)  ≈2.624475549

and the optimal stopping strategy is as follows . . .

  • If 24≤b≤26, play while r≥b−5.
  • If 17≤b≤23, play while r≥b−4.
  • If 11≤b≤16, play while r≥b−3.
  • If 6≤b≤10, play while r≥b−2.
  • If 3≤b≤5, play while r≥b−1.
  • If 1≤b≤2, play while r≥b.
  • If b=0, play while r>0.  

So, The maximum earning is v(r,b)

Learn more about PROBABILITY here

brainly.com/question/24756209

#SPJ4

4 0
2 years ago
What would the range be of this function? I found the domain
Licemer1 [7]
The range would be1\leq  y
6 0
3 years ago
Read 2 more answers
Are the triangles congruent? Why or why not?
Mariulka [41]

Answer:

Yes, because they are identical to eachother

Step-by-step explanation:

4 0
3 years ago
Read 2 more answers
Other questions:
  • A motorboat takes
    5·1 answer
  • I need to know how to work<br> This
    10·1 answer
  • Please solve number 27.) -5(3-q) +4 =5q-11
    9·2 answers
  • Help please I need to find the answer to x
    9·2 answers
  • Select all the statements about the figure that MUST be true. Р Q 6n + 3 S 4n + 11 R PR=15 QS=21 QP=13 n=7 SR=27 QR=54​
    13·1 answer
  • For each sequence find the first 4 terms and 10th term 2n squared
    14·1 answer
  • Which of the following graphs could represent the volume of water in a cylinder as a
    15·2 answers
  • Please follow me on twitch: tiger1961
    5·1 answer
  • At a pet store, an iguana eats 7 ounces of food for every 2 ounces a
    10·1 answer
  • What is x to the nearest tenth? <br><br><br> Show work pls.
    12·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!