Download as:
Rating : ⭐⭐⭐⭐⭐
Price: $10.99
Language:EN
Pages: 2

You are viewing 1/3rd of the document.
Purchase the document to get full access instantly.

Immediately available after payment
Both online and downloadable
No strings attached

This first example similar assignment webassign quiz question

Suppose we want to solve the ordinary differential equation

dx
dt= 3x.

d
dtx = Ax where

dx1
A =

13  , 1

x = x1  andd dtx =
4 1 1 dt
dx2
5 x2
0   dt
dx3
1 x3
dt
P =

1
1

10

(b) Solve the systems of equations you found in (a). Do the variables y1, y2 and y3 increase or decrease with time?

(c) Rewrite the solution in terms of the original x vector.

MATH1115, Tutorial Worksheet for Week 9

2

Calculus

(b) Give an example of a continuous function f : [0, ∞) R which is bounded but does not have a maximum value.

(c) Give an example of a continuous function f : (0, 1] R which is not bounded.
(d) Give an example of a continuous function f : (0, 1] R which is bounded but does not have a maximum value.

(a) f(x) = 1/x, a = 1, = 1;
[N.B. This first example is similar to Assignment 3 WebAssign Quiz Question 8, except that we are using ε and δ instead of r and s. More importantly, there is another difference: you are not asked to find the largest value of δ that makes the implication true. All you need to do is find some value δ > 0 such that 0 < |x − a| < δ =⇒ |f(x) − ℓ| < ε. Hence there are many possible answers: once you have one answer that works, any smaller value of δ > 0 will also work (why?).]

(b) f(x) = 3x + 7, a ∈ R is arbitrary but fixed, = 3a + 7; (c) f(x) = x4, a > 0 is arbitrary but fixed, = a4;

Question 4. Subspace of a Vector Space

Prove: If U1, U2, · · · , Uk are subspaces of a vector space V , then U1 + U2 + · · · + Uk is a subspace of V that contains all of the subspaces U1, U2, · · · , Uk. Furthermore, each subspace Z of V which contains U1, U2, · · · , Uk must contain U1 + U2 + · · · + Uk. Thus U1 + U2 + · · · + Uk is the smallest subspace of V containing U1, U2, · · · , Uk.

Copyright © 2009-2023 UrgentHomework.com, All right reserved.