CSPP 512 Mathematics for Computer Science - Summer 2001
Homework 10 (assigned August 22, due August 29)
This homework assignment covers the material in sections 3.2 and
3.5 of the textbook.
-
Do problems 25, 26, and 28 on page 127.
(Each problem is worth 4 points.)
-
Do problems 39, 41, 44, 48 (hard), and 50 on page 151.
(Each problem is worth 4 points.)
-
Find the least integer n such that f(x) is O(xn) for the
functions:
(1) f(x) = 2x2 + x3lg x
(2) f(x) = 3x5 + (lg x)4
(Each part of this problem is worth 4 points.)
-
Give a big-Oh estimate for each of the following functions. For the
function g(n) in your estimate "f(n) = O(g(n))" use a simple
function g(n) close in size to f(n):
(1) f(n) = (n3 + n2lg n)(lg n + 1)
+ (17 lg n + 19)(n3 + 2)
(2) f(n) = (2n + n2)(n3 + 3n)
(Each part of this problem is worth 4 points.)
-
If f1(n) and f2(n) are functions from the
natural numbers to the positive real numbers and
f1(n) and f2(n) are both Theta(g(n)), is
f1(n) - f2(n) also Theta(g(n))? If your answer
is yes, please prove it using the definition of Theta notation; if your
answer is no, please give a counterexample. (4 points)
Challenge Problem (optional)
-
Prove that if
f(x) = anxn +
an-1xn-1 +
a1x + a0, where
an, an-1, ...,
a1, a0 are real numbers and
an is not equal to 0, then
f(x) = Theta(xn). You may
assume that x > 0.
Please note that last week's challenge homework problem was to prove
that this polynomial is Omega(xn). If you
submitted a solution for last week's challenge homework, you may
appeal to that solution and submit a proof to show that
f(x) above is O(xn).
(5 points)
Gerry Brady
Wed Aug 22 19:06:11 CDT 2001