Solution:
before starting let's have a look at Big-O first.
2)
a)
comparing f(n) and g(n) we can see that:
n^2 + 7n <= c*n^3-2n^2
for c>0, the above inequality holds true
so, g(n)= O(f(n))
b)
after applying logarithmic property we can wrtie f(n) as
f(n)= 12 lg n
comparing f(n) and g(n),
we can see that
f(n)<= c*g(n)
for c> 0
This means that g(n)= O(f(n))
I hope this helps if you find any problem. Please comment below. Don't forget to give a thumbs up if you liked it. :)
2. (10 pts.) Show that either g(n) Ofn)) or frn) -O(g(n) for the following. g(n)n2 +...
Show that either g(n) = O(f(n)) or f(n) = O(g(n)) : 1. g(n) = n^2 +7n , f(n) = ^3 -2n^2 2. g(n) = 2n +4 , f(n) = 6lg(n^2)
2. (40 pts) Let fn: RR be given by sin(n) In(x) = n2 NEN. 2a. (10 pts) Show that the series 2n=1 fn converges uniformly on R. 2b. (10 pts) Show that the function f: RR, f (x) = sin (nx) n2 n=1 is continuous on R. 2c. (10 pts) Show that f given in 2b) is intergrable and $(z)de = 24 (2n-1) 2d. (10 pts) Let 0 <ö< be given. Show that f given in 2b) is differentiable at...
2c. (10 pts) Show that f given in 2b) is intergrable and [ 1 (2) dr = 2Ě (2n-1) 2d. (10 pts) Let 0 < < be given. Show that f given in 2b) is differentiable at each 1 € (5,27 - 8). Find f' (1). Hint: Use Problem 1 and the following formula In 2 (-1)"-1 Σ 7 n=1 2. (40 pts) Let fn: R → R be given by fn (x) = sin (nx) 3 ηε Ν. n2...
3. (10 pts) For each of the following functions f(n), prove the stated claim by providing constants no C1, and c2 such that for all n2 no, cig(n) S f(n) or f(n) c2g(n), and provide a calculation that shows that this inequality does indeed hold (a) f(n) 2n2 3n3-50nlgn10 0(n3) O(g(n)) (b) f(n)-2n log n + 3n2-10n-10-Ω ( 2)-0(g(n))
Which of the following series diverges? n +2 2n -1 n1 n+3 O A. 2 B. O C. 1,3 O D. 1, 2 OE. 2, 3 F. None O G. O H. 1,2,3 Find the sum of the series A. B. OC. 1/10 D. 1/2 3/2 3/4 OE. 1 F. 5/12 OG. 1/4 H. Divergent Which of the following series converges? oo 2n 1.Σ n 1 23n nE1 (n+ 1)3 n+ 1 3. O A. None O B. 2 O...
Let G be a simple graph with 2n, n 2 vertices. Suppose there are at least n2 1 edges. Show that at least one triangle is formed. Hint: Check n 2 first and then use induction Let G be a simple graph with 2n, n 2 vertices. Suppose there are at least n2 1 edges. Show that at least one triangle is formed. Hint: Check n 2 first and then use induction
1 question) Arrange the following in the order of their growth rates, from least to greatest: (5 pts) n3 n2 nn lg n n! n lg n 2n n 2 question)Show that 3n3 + n2 is big-Oh of n3. You can use either the definition of big-Oh (formal) or the limit approach. Show your work! (5 pts.) 3 question)Show that 6n2 + 20n is big-Oh of n3, but not big-Omega of n3. You can use either the definition of big-Omega...
2 2n-1 n2+6n+8 Determine the exact value of the given infinite series: 10. D) 7 B) A) 3 10 JY 11 21 H) 6 G) 12 F) ela 2 2n-1 n2+6n+8 Determine the exact value of the given infinite series: 10. D) 7 B) A) 3 10 JY 11 21 H) 6 G) 12 F) ela
Asymptotic notation O satisfies the transitive property i.e. if f(n)=O(g(n)) and g(n)=O(h(n)), then f(n)=O(h(n)). Now we know that 2n =O(2n-1), 2n-1 =O(2n-2?),....... , 2i=O(2i-1?),....... So using rule of transitivity, we can write 2n =O(2i-1?).We can go extending this, so that finally 2n =O(2k?), where k is constant.So we can write 2n =O(1?). Do you agree to what has been proved?If not,where is the fallacy? 6 marks (ALGORITHM ANALYSIS AND DESIGN based problem)
All of question 2 please 1. True or false: (15 pts) {(-1)" tan (TC/2-3/n} is oscillating. (b) 1/2-1/4+1/6-1/8+1/10-..... converges conditionally. A convergent sequence is always Cauchy. {1/n) is a Cauchy sequence. (1-3)-(1-31/2)+(1-313)-(1-314 )+.....diverges. 2. Find limit sup and limit inf of the following sequences: (10 pts) (a){c+4) sin ng (b) {(1+m+)"} Limsup= limsup= Lmitinf= liminf= 3. Prove that either the following sequence has a limit or not. (20 pts) (a) 2n (b) n2+4n+2 n+6vn n-1