Answer:
The solution is given as 
Step-by-step explanation:
It is given that
![\lim_{\Delta \to 0} \sum_{k=1}^{n}(x_{k}^{*})^4\Delta x_{k} \, \,\,\,\,\,\,\,\,\, [6, 10]](https://tex.z-dn.net/?f=%5Clim_%7B%5CDelta%20%5Cto%200%7D%20%5Csum_%7Bk%3D1%7D%5E%7Bn%7D%28x_%7Bk%7D%5E%7B%2A%7D%29%5E4%5CDelta%20x_%7Bk%7D%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%5C%2C%20%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%20%5B6%2C%2010%5D)
As
where a and b are the lower and upper limits of the bound respectively.
On comparison it is observed that
So the equation is given as

So the solution is given as 
Answer:
Simplified it would be 11x^2y^2 - 4xy^
<h3>
Answer: 210</h3>
Work Shown:
7 ways to pick the president.
6 ways to pick the VP
5 ways to pick the secretary
7*6*5 = 210 ways to pick the three people from a pool of seven. Order matters because the positions are different. Note the count down from 7 to 6 to 5 which indicates that any given person cannot run for more than one office.
You can use the permutation formula with n = 7 and r = 3
The permutation formula is
where the exclamation marks represent factorials.
21212121313233456899876221