Jump to content

Mathematics for Applied Sciences (Osnabrück 2023-2024)/Part I/Exercise sheet 7/refcontrol

From Wikiversity



Exercises

Have you ever seen in a newspaper an expression of the form 2.17 (a vinculum to indicate a repeating decimal) or 2.17171717...? Why not? What kind of decimal expansions occur in a newspaper (in a manual, as a result of a measurement, in a technical description)?


We want to find a rational approximation for the number 1000000π, such that the deviation of the true value should be at most 11000. How good has to be an approximation for π such that we obtain the asked for approximation?


Is there any relation between the Din-Norm for paper and square roots?


Compute by hand the approximations x1,x2,x3,x4 in Heron's method to find the square root of 5 with initial value x0=2.


Do the first three steps in Heron's method to compute the square root of b=7 with initial value x0=3 (so the approximations x1,x2,x3 for 7 shall be computed; these numbers have to be given as fractions reduced to lowest terms).


Let c+ be a positive real number and let (xn)n be the Heron-sequenceMDLD/Heron-sequence for the computation of c with the initial value x0+. Let u+, d=cu2, y0=ux0 and let (yn)n be the Heron-sequence for the computation of d with initial value y0. Show that

yn=uxn

holds for all n.


Determine for the sequence

xn:=23n+5

and

ϵ=110,1100,11000,110000,,

for which (minimal) n the estimate

xnϵ

holds.


===Exercise Exercise 7.7

change===

Let (xn)n be a real sequence. Prove that the sequence converges to x if and only if for all k+ a natural number n0 exists, such that for all nn0 the estimation |xnx|1k holds.


Negate the statement that a sequence xn convergesMDLD/converges (R) in to x by transforming the quantifiers.


Examine the convergence of the following sequence

xn=1n2

where n1.


Regarding the sequence xn:=n2n, somebody says: "The numerator and the denominator are both going to infinity. However, the denominator is much faster, therefore the sequence converges to 0“. What do you think about this argument?


Determine whether the following subsets M are boundedMDLD/bounded (R) or not.

  1. ,
  2. {12,37,49,59,613,13,14},
  3. ]5,2],
  4. {1nn+},
  5. {1nn+}{0},
  6. ,
  7. {xx22},
  8. {xx24},
  9. {x2x}.


Let x>1 be a real number.MDLD/real number Show that the sequence xn:=xn is not bounded.MDLD/bounded (R)


Let (xn)n be a null sequence and let (yn)n be a bounded real sequence. Show that also the product sequence (xnyn)n is a null sequence.


===Exercise Exercise 7.16

change===

Let (xn)n and (yn)n be convergent real sequences with xnyn for all n. Prove that limnxnlimnyn holds.


===Exercise Exercise 7.17

change===

Let (xn)n,(yn)n and (zn)n be three real sequences. Let xnynzn for all n and (xn)n and (zn)n be convergent to the same limit a. Prove that also (yn)n converges to the same limit a.


Let (xn)n be a convergent sequence of real numbers with limit equal to x. Prove that also the sequence
(|xn|)n
converges, and specifically to |x|.


Let the sequence (xn)n be given by

xn={1, if n is a prime number ,0 else.
  1. Determine x117 and x127.
  2. Does this sequence converge in ?


Prove by induction the Binet formula for the Fibonacci numbers. This says that

fn=(1+52)n(152)n5

holds (n1).




Hand-in-exercises

===Exercise (3 marks) Create referencenumber=== Compute by hand the approximations x1,x2,x3,x4 in Heron's method to find the square root of 7 with initial value x0=2.


Write a computer-program (pseudocode) for the computation of rational approximations for the square root of a rational number using Heron's method.MDLD/Heron's method

    • The computer has as many memory units as needed, which can contain natural numbers.
    • It can compare the content of memory units and can, depending on the outcome, switch to a certain program line.
    • It can add the content of two memory units and write the result into another memory unit.
    • It can multiply the content of two memory units and write the result into another memory unit.
    • It can print contents of memory units and it can print given texts.
    • There is a stop command.

The initial configuration is

(a,b,c,d,e,0,0,)

with b,c,e0. Here, a/b is the number from which we want to compute the square root, x0=c is the initial value and d/e is the wished-for accuracy. The program shall compute and print the Heron-sequence x0,x1,x2, (the numerators and denominators are printed successively) and it shall stop when the member xn printed last fulfills the property

|xn2ab|de.

Attention! All operations are to be done within !


Determine for the sequence

xn:=2n+13n4

and for

ϵ=110,1100,11000,

for which (minimal) n the estimate

|xn23|ϵ

holds.


Let (xn)n be a convergentMDLD/convergent (R) real sequenceMDLD/real sequence with limitMDLD/limit (real sequence) x. Show that the sequence defined by

yn:=x0+x1++xnn+1

also converges to x.
Hint: reduce to the case x=0.


Prove that the real sequence

n2n
converges to 0.
Hint: Find a suitable estimate for 2n using the binomial theorem.


Let (xn)n and (yn)n be sequences of real numbers and let the sequence (zn)n be defined as z2n1:=xn and z2n:=yn. Prove that (zn)n converges if and only if (xn)n and (yn)n converge to the same limit.



<< | Mathematics for Applied Sciences (Osnabrück 2023-2024)/Part I | >>
PDF-version of this exercise sheet
Lecture for this exercise sheet (PDF)