• Keine Ergebnisse gefunden

Introduction to Mathematical Software Exercise 2

N/A
N/A
Protected

Academic year: 2022

Aktie "Introduction to Mathematical Software Exercise 2"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Introduction to

Mathematical Software Exercise 2

PD Dr. Ulf Lorenz Winter Term 2010/2011

Dipl.-Math. Christian Brandenburg Week: 08.11.2010 - 12.11.2010

Problem 1 plotandplot3d

a) Let

f(x) =sin(π·x3), g(x) =ex2.

Plot f(x)andg(x)withx∈[−2, 2]. Get familiar with theplots-package. Try to plot f and ginto one picture.

b) Ploth(x) =x2and its derivative from x=0to∞. Enjoy the result!

c) How can you plot the functionMonkeySaddle(x,y) =x3−3·x·y2, x∈[−2, 2], y∈[−2, 2]? Take a look into Maple’s help in order to find out more about plotting.

Problem 2 Lists and Sets in Maple

a) Explain the difference between lists and sets in Maple.

b) Use Maple to find the common divisors of23545800, 25491186 and229420674. Hint: How can the package numtheoryhelp you?

c) Let Maple evaluate the functionsinfor all solutions of the equation

x4−4·x3·π+26

9 ·x2·π2+4

x·π3−1

π4=0 by usingsolveand

i) map,

ii) the element-wise operator∼(only if you are using Maple 14, as this is not implemented in Maple 11).

Problem 3 Solving Systems of Linear Equations

Try to solve the following systems of linear equations. What is happening?

x+8·y+4·z=7 2·x+8·y+4·z=7 6·x+2·y+4·z=9 6·x+2·y+4·z=9

x+z=8

x+8·y+4·z=7 2·x+8·y+4·z=7 6·x+2·y+4·z=9 6·x+2·y+4·z=9 3·x+8·y+5·z=15 3·x+8·y+5·z=9

x+z=8 x+z=8

1

(2)

Introduction to Mathematical Software – Exercise 2 Week: 08.11.2010 - 12.11.2010

Problem 4 Curve Sketching Let

f(x) = x2+5·x−12 2·x2−12·x+16.

a) Plotf(x)forx∈[−10, 10]. Use the same Interval as range of your plot. Have a look at help topicplot/options in order to find out how to do that. Also try to find out how to avoid ugly discontinuities in your plot.

b) Find the domain [DEFINITIONSBEREICH] of f. c) Find the zeros [NULLSTELLEN] off.

d) Find local minima and maxima off. e) Find inflection points [WENDEPUNKTE] of f.

f) Calculate the area under the graph between the first two zeros (there should be at least two zeros).

Don’t Drink and Derive – Episode 1

Two math professors are sitting in a pub.

“Isn’t it disgusting”, the first one complains, “how little the general public knows about mathematics?”

“Well”, his colleague replies, “you’re perhaps a bit too pessimistic.”

“I don’t think so”, the first one replies. “And anyhow, I have to go to the washroom now.”

He goes off, and the other professor decides to use this opportunity to play a prank on his colleague. He makes a sign to the pretty, blonde waitress to come over.

“When my friend comes back, I’ll wave you over to our table, and I’ll ask you a question. I would like you to answer:

x to the third over three. Can you do that?”

“Sure.” The girl giggles and repeats several times: “x to the third over three, x to the third over three, x to the third over three...”

When the first professor comes back from the washroom, his colleague says: “I still think, you’re way too pessimistic.

I’m sure the waitress knows a lot more about mathematics than you imagine.”

He makes her come over and asks her: “Can you tell us what the integral of x squared is?”

She replies: “x to the third over three.”

The other professor’s mouth drops wide open, and his colleague grins smugly when the waitress adds: “...plus C.”

2

Referenzen

ÄHNLICHE DOKUMENTE

In this exercise, we implement Euclid’s algorithm for finding the greatest common divisor of two natural numbers that you have come across in your linear algebra class. This will

• a two-dimensional array of type double** (i.e. an array of pointers to arrays of type double) with the first index being the row index and the second index being the column

An vielen Türen hängen Plakate mit Rätseln, deren Lösung eine Zahl zwischen eins und

In this exercise we introduce the so called O-notation that is used to compare the efficiency of algorithms, in particular for arbitrarily large inputs. Definition 1 Let g : N → N be

Remark: Remember that you have to use the g++ comiler: g++ rational.cc -o rational To view your data type, add a class member function like. void

The algorithm is very inefficient as the number of recursive calls to Fib(n) grows exponentially in n. It is much more efficient to compute the Fibonacci numbers iteratively, as

• a two-dimensional array of type double** (i.e. an array of pointers to arrays of type double) with the first index being the row index and the second index being the column

❏ If a memory card is inserted in the memory card slot, the printer does not recognize the external storage device; it prints out the photo data in the memory card.. ❏ Select