When rolled, two dice should come up to a sum of 8 at a rate of
13.89%. I roll two dice 100 times and get 11 sums of 8.
a) At the .01 level are the dice coming up at a statistically
different % of 8 than expected? (p = .403)
Provide an example of a proof by mathematical induction.
Indicate whether the proof uses weak induction or strong induction.
Clearly state the inductive hypothesis. Provide a justification at
each step of the proof and highlight which step makes use of the
inductive hypothesis.
The company has just come up with a new highly profitable
product. As a result it plans to retain all earnings for the next 3
years (i.e. b=1) and invest them at a return (R) of 100% per year.
After three years the company will go back to its old policy of
retaining 60 percent of its earnings and investing them at 20
percent.
What will be the new price of the stock?
The new PE ratio
The new premium...
This example was previously posted, but how did we come up with
a Q1 result of 28.5 and a Q3 result of 123.3 for the question
below? I am wondering where I went wrong here, as the results to
this question have already been posted. The results I have are Q1
of 29 and Q3 of 121 with a median of 69. I have IQR as 92 and for
outliers I have -109 for lower limit and 259 for upper...
Create a mathematical proof to prove the following:
Given an integer n, and a list of integers such that the
numbers in the list sum up to n. Prove that the product of a list
of numbers is maximized when all the numbers in that list are 3's,
except for one of the numbers being either a 2 or 4, depending on
the remainder of n when divided by 3.
Show in a formal mathematical proof, theoretical analysis, an
even split of an array into two subarrays which answers in the best
performance of quicksort algorithm "appraised with respect to the
running time". coding or empirical investigation are not
needed.
In the proof of bolzano-weierstrass theorem in R^n on page 56 of
"Mathematical Analysis" by Apostol, should the inequality be
a/2^(m-2) < r/sqrt(n) or something related to n? a/2^(m-2) <
r/2 seems not enough
Show in a formal mathematical proof, theoretical analysis,
substitution method, an even split of an array into two subarrays
which answers in the best performance of quicksort algorithm
"appraised with respect to the running time". coding or empirical
investigation are not needed.