Show that (1 + 2 +. . .+n)2 > 12 +. . .+ n2, for n...

Show that (1 + 2 +. . .+n)² > 1² +. . .+ n², for n ≥ 2.

Expert Solution

As we can can see that the first term(left side term) is nothing but the square of the sum of first "N" natural number

which is nothing but is equals to

because the sum of first n natural number is (n*(n+1)/2).

so it will be equal to

Now the second term(right side term) is nothing but the sum of square of first "N" natural numbers And it is given by

Which is equal to

now we can write first term as ,

now as given "n" must be greater or equal to 2, let's check if

is positive for minimum value of "n" or not because as the second term is contained in the first term as shown in above now if it is positive means after subtracting the second term from the first term we will get positive number that means first term is greater than the right side term. if we put n=2 in we get (16-8-2)/6 =1 which is [positive number that means the left hand side terms is greater than right hand side term.

venereology answered 5 months ago

1- Show that (n^3+3n^2+3n+1) / (n+1) is O (n2 ). Use the definition and proof of...

1- Show that (n^3+3n^2+3n+1) / (n+1) is O (n2 ). Use the definition and proof of big-O notation. 2- Prove using the definition of Omega notation that either 8 n is Ω (5 n ) or not. please help be with both

A sequence {an} is given by: an = n2 - 1, n € N. Show that it is not an arithmetic progression (A.P)?

For all n > 2 except n = 6, show how to arrange the numbers 1,2,...,n2...

For all n > 2 except n = 6, show how to arrange the numbers 1,2,...,n2 in an n x n array so that each row and column sum to the same constant.

Show that (a)Sn=<(1 2),(1 3),……(1 n)>. (b)Sn=<(1 2),(2 3),……(n-1 n)> (c)Sn=<(1 2),(1 2 …… n-1 n)>

(1) T(n)=9⋅T(n3)+n2⋅(log⁡(n))2 (2) T(n) = 10 * T(n/3) + n^2 One of these can be solved...

(1) T(n)=9⋅T(n3)+n2⋅(log⁡(n))2 (2) T(n) = 10 * T(n/3) + n^2 One of these can be solved using the Master Theorem; the other cannot. Which one can be solved using the Master Theorem? Compute the solution to this recurrence relation. Which one cannot be solved using the Master Theorem? Carefully explain why not. (NOTE: A complete solution will use the definition of big-O.) Use another method to solve this recurrence relation. To make this a bit easier, you may assume that...

By induction: 1. Prove that Σni=1(2i − 1) = n2 2. Prove thatΣni=1 i2 = n(n+1)(2n+1)...

By induction: 1. Prove that Σni=1(2i − 1) = n2 2. Prove thatΣni=1 i2 = n(n+1)(2n+1) / 6 .

Let x1 > 1 and xn+1 := 2−1/xn for n ∈ N. Show that xn is...

Let x1 > 1 and xn+1 := 2−1/xn for n ∈ N. Show that xn is bounded and monotone. Find the limit. Prove by induction

(a) Find the limit of {(1/(n^(3/2)))-(3/n)+2} and use an epsilon, N argument to show that this...

(a) Find the limit of {(1/(n^(3/2)))-(3/n)+2} and use an epsilon, N argument to show that this is indeed the correct limit. (b) Use an epsilon, N argument to show that {1/(n^(1/2))} converges to 0. (c) Let k be a positive integer. Use an epsilon, N argument to show that {a/(n^(1/k))} converges to 0. (d) Show that if {Xn} converges to x, then the sequence {Xn^3} converges to x^3. This has to be an epsilon, N argument [Hint: Use the difference...

Let ?=2^(2^?)+1 be a prime that n>1 1. Show that ? ≡ 2(mod5) 2. Prove that...

Let ?=2^(2^?)+1 be a prime that n>1 1. Show that ? ≡ 2(mod5) 2. Prove that 5 is a primitive root modulo ?

Justify the following statements using the "big-Oh" definition: a) (n+25)2 is O(n2) , and n2 is...

Justify the following statements using the "big-Oh" definition: a) (n+25)2 is O(n2) , and n2 is O((n+25)2) b) n3 is NOT O(n2); c) Given f1(n) is (n+25)2 , and f2(n) is n3 what is the big-Oh for f1(n) x f2(n)?

Question