This document discusses using a mathematical model of a discrete logistic map to simulate population growth over time. The model takes an initial population p0 between 0 and 1 and calculates subsequent terms using the formula pn+1 = kpn(1-pn) where k is a parameter between 1 and 4. The document asks the reader to:
1. Graph sequences for different values of k and p0 and observe their behavior.
2. Notice that for k between 3 and 3.4 the terms appear random, while for k between 3.4 and 3.5 the behavior changes.
3. Experimenting with values of k between 3.4 and 3.5 reveals that the terms exhibit chaotic behavior.
This document discusses using a mathematical model of a discrete logistic map to simulate population growth over time. The model takes an initial population p0 between 0 and 1 and calculates subsequent terms using the formula pn+1 = kpn(1-pn) where k is a parameter between 1 and 4. The document asks the reader to:
1. Graph sequences for different values of k and p0 and observe their behavior.
2. Notice that for k between 3 and 3.4 the terms appear random, while for k between 3.4 and 3.5 the behavior changes.
3. Experimenting with values of k between 3.4 and 3.5 reveals that the terms exhibit chaotic behavior.
This document discusses using a mathematical model of a discrete logistic map to simulate population growth over time. The model takes an initial population p0 between 0 and 1 and calculates subsequent terms using the formula pn+1 = kpn(1-pn) where k is a parameter between 1 and 4. The document asks the reader to:
1. Graph sequences for different values of k and p0 and observe their behavior.
2. Notice that for k between 3 and 3.4 the terms appear random, while for k between 3.4 and 3.5 the behavior changes.
3. Experimenting with values of k between 3.4 and 3.5 reveals that the terms exhibit chaotic behavior.
This document discusses using a mathematical model of a discrete logistic map to simulate population growth over time. The model takes an initial population p0 between 0 and 1 and calculates subsequent terms using the formula pn+1 = kpn(1-pn) where k is a parameter between 1 and 4. The document asks the reader to:
1. Graph sequences for different values of k and p0 and observe their behavior.
2. Notice that for k between 3 and 3.4 the terms appear random, while for k between 3.4 and 3.5 the behavior changes.
3. Experimenting with values of k between 3.4 and 3.5 reveals that the terms exhibit chaotic behavior.
asks these questions: Will it stabilize at a limiting value? Will it change in a cyclical fashion? Or will it exhibit random behavior? Write a program to compute the first n terms of this sequence starting with an initial population p0, where 0 < p0 < 1. Use this program to do the following. 1. Calculate 20 or 30 terms of the sequence for p0 = 1 2 and for two values of k such that 1 < k < 3. Graph each sequence. Do the sequences appear to converge? Repeat for a different value of p0 between 0 and 1. Does the limit depend on the choice of p0? Does it depend on the choice of k? 2. Calculate terms of the sequence for a value of k between 3 and 3.4 and plot them. What do you notice about the behavior of the terms? 3. Experiment with values of k between 3.4 and 3.5. What happens to the terms?
1 Problems Sections 11.4 and 11.5 1.1 (F)
True or False (1) If an > 0 and lim n→∞ nan 6= 0, thenPan is divergent.(2) If an > 0 andPan is convergent, thenPln(1 + an) is convergent.(3) If Pan is a convergent series with positive terms,thenPsin(an) is also convergent. (4) If Pan and Pbn are are both convergent series with positive terms, then Panbn is also convergent.(5) If Pan andPbn are series with positive terms andPbn is convergent. Prove that if lim n→∞ an bn = c , c > 0 thenPan is also convergent.(6) If an ≥ 0 andPan converges, thenPa2 n also converges. (7) LetPan andPbn be with positive terms where limn→∞(an bn ) = 0, ifPbndiverges, then Pan diverges.(8) If P∞ n=1 an converges, thenP∞ n=1(|an|+ an) converges. (9) IfP∞ n=1(|an|+ an) converges, thenP∞ n=1 an converges. 1.2 Use any test to determine whether the series is absolutely convergent, conditionally convergent, or divergent. (a) (F) ∞ X n=1 (−1)n+1 n2 n3 + 4 (b) ∞ X n=1 (−1)n+1ne−n (c) (F) ∞ X 1 (−1)ncos( π n ) (d) ∞ X n=1 ( n lnn )n (e) ∞ X n=1 (−1)n nlnn (f) 1− 2! 1·3 + 3! 1·3·5 − 4! 1·3·5·7 +···+ (−1)nn! 1·3·5···(2n−1) +··· Calculus (II) — 2020.3.12 Sections 11.4 and 11.5 1 1.3 For what values of p is each series convergent? (a) ∞ X n=1 (−1)n−1 np (b) ∞ X n=1 (−1)n n + p (c) (F) ∞ X n=1 (−1)n−1(lnn)p n 1.4 Test the series for convergence or divergence. (a) ∞ X n=1 ( n n + 1 )n2 (b) ∞ X n=1 1 n1+1/n (c) ∞ X n=1 1 (lnnlnn) (d) ∞ X n=1 ( n √2−1)n (e) ∞ X n=1 ( n √2−1) 1.5 Show that the series is convergent. How many terms of the series do we need to add in order to find the sum to the indicated accuracy? 1. (F)P∞ n−1 (−1)n+1 n6 (|error| < 0.00005) 2. P∞ n−1 (−1)n n5n (|error| < 0.0001) 1.6 (F) Find the sum of the series 1 + 1 2 + 1 3 + 1 4 + 1 6 + 1 8 + 1 9 + 1 12 +··· where the terms are the reciprocals of the positive integers whose only prime factors are 2s and 3s. Calculus (II) — 2020.3.12 Sections 11.4 and 11.5 2 1.7 (F) If a0 + a1 + a2 +···+ ak = 0, show that lim n→∞ (a0√n + a1√n + 1 + a2√n + 2 +···+ ak√n + k) If you don’t see how to prove this, try the problem-solving strategy of using analogy (see page75). Try the special cases k=1 and k=2 first. If you can see how to prove the assertion for these cases, then you will probably see how to prove it in general. 2 Problems Plus 2.1 Use the following steps to show that ∞ X n=1 (−1)n−1 n = ln2 Let hn and sn be the partial sums of harmonic and alternating harmonic series. (a) Show that s2n = h2n −hn. (b) From the fact that the sequence tn = 1 + 1 2 + 1 3 +···+ 1 n −lnn has a limit, (The value of the limit is denoted by and is called Euler’s constant.) we have hn −lnn → γ asn →∞ and therefore h2n −ln(2n) → γ asn →∞ Use these facts together with part (a) to show that s2nln2 as n →∞. 2.2 Suppose you have a large supply of books, all the same size, and you stack them at the edge of a table, with each book extending farther beyond the edge of the table than the one beneath it. Show that it is possible to do this so that the top book extends entirely beyond the table. In fact, show that the top book can extend any distance at all beyond the edge of the table if the stack is high enough. Use the following method of stacking: The top book extends half its length beyond the second book. The second book extends a quarter of its length beyond the third. The third extends one- sixth of its length beyond the fourth, and so on. (Try it yourself with a deck of cards.) Consider centers of mass. Calculus (II) — 2020.3.12 Sections 11.4 and 11.5 3 2.3 Suppose that circles of equal diameter are packed tightly in n rows inside an equilateral triangle. (The figure illustrates the case n=4.) If A is the area of the triangle and An is the total area occupied by the n rows of circles, show that