Problem 5. Each of the following sequences converges to π: an = 6 √3 n k=0 n bn = (-1)k 3k (2k + 1)' (-1)k 1652k+1 (2k+1) k=0 n - 4 Σ k=0 (−1)k 2392k+1 (2k+1) (a) Write a MATLAB script that computes ao, ..., ana, where na is the smallest integer such that ana T| < 10-6. Use fprintf to display your results in three columns, where the first column is the values of n, the second column the value of an, and the third column - the value of ana — π|. (b) Repeat part (a) for bo,.. ... , bn, where nɩ is the smallest integer such that |b - π| < 10−6.

Problem 5. Each of the following sequences converges to π: an = 6 √3 n k=0 n bn = (-1)k 3k (2k + 1)' (-1)k 1652k+1 (2k+1) k=0 n - 4 Σ k=0 (−1)k 2392k+1 (2k+1) (a) Write a MATLAB script that computes ao, ..., ana, where na is the smallest integer such that ana T| < 10-6. Use fprintf to display your results in three columns, where the first column is the values of n, the second column the value of an, and the third column - the value of ana — π|. (b) Repeat part (a) for bo,.. ... , bn, where nɩ is the smallest integer such that |b - π| < 10−6.

College Algebra

1st Edition

ISBN:9781938168383

Author:Jay Abramson

Publisher:Jay Abramson

Chapter9: Sequences, Probability And Counting Theory

Section: Chapter Questions

Problem 46RE: Find the fourth term of (3a22b)11 without fully expanding the binomial.

See similar textbooks

Similar questions

Find the fourth term of (3a22b)11 without fully expanding the binomial.
In the expansion of (5x+3y)n , each term has the form (nk)ankbk ,where k successively takes on the value 0,1,2....,n. If (nk)=(72) what is the corresponding term?
Suppose the sequence a(n) satisfies the following divide-and-conquer recurrence: T(n) = 4T(n/2) + 10n; T(1) = 3. (a) Assuming n = 2k, fill in the recursion tree diagram below for T(n): help (numbers) Level 0 1 2 k = log₂ n Number of problems Problem size Work per problem Work per level 1 10n NOTE: Enter variable answers in terms of n. (b) Find a closed (explicit) formula for T(n). T(n) = 4 4^2 n n/2 n/4 1
3. We found in class that if Cn counts the number of ways to make change (in standard coins) for n cents, the generating function for this sequence is Σ n=0 Cnxn = 1 (1 − x) (1 − x5) (1 – x¹0) (1 − x²5) - - Let an again be the number of ways to make change for n cents, but with the added feature that we care about the order in which the coins are chosen. We could say, for example, that an is the number of ways to feed coins totalling n cents one by one into a machine. Give a closed-form generating function for the sequence (an). [Hint: you will use 0 coins in total, or 1 coin in total, or 2 coins in total...]
A particle performs a random walk on the corners of the square ABCD. At each step, the probability of moving from corner c to corner d equals pcd, where PAB = PBA = PCD = PDC = α, PAD = PDA = PBC = PCB = B, and a, ß > 0, a + B = 1. Let GA (s) be the generating function of the sequence (PAA (n): n ≥ 0), where PAA (n) is the probability that the particle is at A after n steps, having started at A. Show that GA(S) = - ²2 { 1 -² 3² + 1 - 18 - 0²1²25² 1 1 1252}. Hence find the probability generating function of the time of the first return to A.
Find the sequence {an}nzo for the generating function G(x) = = ao = 4, a₁ = 4, a2 = 1 and an = 0,Vn > 3 None of these. ao = 4, a₁ = 4, a₂ = 1 an = 4 if n = 0, 1, 2 and an = 0,Vn > 3 ao = 2, a₁ 1 and an = 0, Vn > 2 = = (x + 2)².