Question

In: Advanced Math

Let n be a positive integer. Let S(n) = n sigma j=1 ((1/3j − 2) −...

Let n be a positive integer. Let S(n) = n sigma j=1 ((1/3j − 2) − (1/3j + 1)). a) Compute the value of S(1), S(2), S(3), and S(4). b) Make a conjecture that gives a closed form (i.e., not a summation) formula for the value of S(n). c) Use induction to prove your conjecture is correct.

Solutions

Expert Solution

Given the Series is -

(a) To compute the value of S(1) , S(2) , S(3) annd S(4) , we will just replace n in the above series by 1 , 2 , 3 and 4 , one by one .

So , we have -

For n = 1 :

i.e.,

For n = 2 , we have -

For n = 3 , we have -

Similarly , for n = 4 , we have -

(b) : we have -

In order find the closed form of the above series , we will use the formula -

Closed   

Where ,

n = number of terms

A = first term of the series

L = last term of the series .

Now , we have -

Number of terms in the given series = n

First term of the series , i.e.,

i.e.,

   AND ,

Last term of the series , i.e.,

Thus Closed form is given as-

Hence , the closed form of the above series is

i.e.,

(c) Till now we have , the closed form the given series as -

Now , we will prove that above statement is true using induction .

Let S(n) be a statement given as -

Step 1: Put n = 1 , in above statement -

, which is true .

Thus , S(1) is true , i.e., S(n) is true for n = 1.

Step 2: Let us suppuse that the given statement S(n) is true for some n = k

so that , we have -

.......(1)

Step 3 : We will now show that the given statement is true for n = ( k + 1) also .

For this -

ADD to both sides of the above equation (1) , we get -

Now LHS and RHS of the above equation will transform as -

The LHS of the above equation is clearly the S(k+1) , i.e.,

Simplifying above expression , we get -

Thus , we have -

i.e.,

Hence , it has been proved by induction that if the statement S(n) is true for each n = k , it is true for n = (k+1) also .

Hence , the conjecture of the closed form is correct .


Related Solutions

For each positive integer, n, let P({n}) =(1/2^n) . Consider the events A = {n :...
For each positive integer, n, let P({n}) =(1/2^n) . Consider the events A = {n : 1 ≤ n ≤ 10}, B = {n : 1 ≤ n ≤ 20}, and C = {n : 11 ≤ n ≤ 20}. Find (a) P(A), (b) P(B), (c) P(A ∪ B), (d) P(A ∩ B), (e) P(C), and (f) P(B′). Hint: Use the formula for the sum of a geometric series
Let n be a positive integer. Prove that if n is composite, then n has a...
Let n be a positive integer. Prove that if n is composite, then n has a prime factor less than or equal to sqrt(n) . (Hint: first show that n has a factor less than or equal to sqrt(n) )
Let L = {0 r | r = s 2 , s a positive integer}. Give...
Let L = {0 r | r = s 2 , s a positive integer}. Give the simplest proof you can that L is not regular using the pumping lemma.
6. Let t be a positive integer. Show that 1? + 2? + ⋯ + (?...
6. Let t be a positive integer. Show that 1? + 2? + ⋯ + (? − 1)? + ?? is ?(??+1). 7. Arrange the functions ?10, 10?, ? log ? , (log ?)3, ?5 + ?3 + ?2, and ?! in a list so that each function is big-O of the next function. 8. Give a big-O estimate for the function ?(?)=(?3 +?2log?)(log?+1)+(5log?+10)(?3 +1). For the function g in your estimate f(n) is O(g(n)), use a simple function g...
. Let xj , j = 1, . . . n be n distinct values. Let...
. Let xj , j = 1, . . . n be n distinct values. Let yj be any n values. Let p(x) = c1 + c2x + c3x 2 + · · · + cn x ^n−1 be the unique polynomial that interpolates the data (xj , yj ), j = 1, . . . , n (Vandermonde approach). (a) Remember that (xj , yj ), j = 1, . . . , n are given. Derive the n...
Prove that τ(n) < 2 n for any positive integer n. This is a question in...
Prove that τ(n) < 2 n for any positive integer n. This is a question in Number theory
Prove the following theorem. If n is a positive integer such that n ≡ 2 (mod...
Prove the following theorem. If n is a positive integer such that n ≡ 2 (mod 4) or n ≡ 3 (mod 4), then n is not a perfect square.
Let G be an abelian group and n a fixed positive integer. Prove that the following...
Let G be an abelian group and n a fixed positive integer. Prove that the following sets are subgroups of G. (a) P(G, n) = {gn | g ∈ G}. (b) T(G, n) = {g ∈ G | gn = 1}. (c) Compute P(G, 2) and T(G, 2) if G = C8 × C2. (d) Prove that T(G, 2) is not a subgroup of G = Dn for n ≥ 3 (i.e the statement above is false when G is...
#2 The Jacobsthal sequence is defined by J(1)=J(2)=1 and J(n)=J(n-1)+2J(n-2). Use recursion to write a function...
#2 The Jacobsthal sequence is defined by J(1)=J(2)=1 and J(n)=J(n-1)+2J(n-2). Use recursion to write a function that takes in a positive integer n and returns the nth Jacobsthal number. >>> J(8) 85 >>> J(9) 171 #3 Use recursion to write a function that takes in a positive integer n and returns all n digit numbers containing only odd digits. >>> f(1) [1, 3, 5, 7, 9] >>> f(2) [11, 13, 15, 17, 19, 31, 33, 35, 37, 39, 51, 53,...
4. Let n ≥ 8 be an even integer and let k be an integer with...
4. Let n ≥ 8 be an even integer and let k be an integer with 2 ≤ k ≤ n/2. Consider k-element subsets of the set S = {1, 2, . . . , n}. How many such subsets contain at least two even numbers?
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT