This assignment is due on the same day as Exam 2 (Tuesday 3/10; not on Wednesday as usual).

This assignment will be included in Exam 2.

Section 13.8

Problems 10, 16, 18, 34.

This assignment is due on the same day as Exam 2 (Tuesday 3/10; not on Wednesday as usual).

This assignment will be included in Exam 2.

Section 13.8

Problems 10, 16, 18, 34.

Advertisements

Dear all,

Exam 2 will take place on Tuesday after the break, 3/10.

It covers all the problems from Exam 1 (see Exam 1 and Solutions at https://udmmath2410w15.wordpress.com/2015/02/11/exam-1-feedback-and-solutions/), the homework assignments between Exam 1 (2/4) and yesterday (2/25), plus one more homework assignment on section 13.8 (Maxima and Minima of Functions of Two Variables), which will be due on the same day as Exam 2. There will be a separate announcement for this homework assignment.

The exam problems will be variations of Exam 1 and homework problems. So, please review these problems again.

If you have any questions, please ask on Monday after the break in class.

See attached flier about this year’s Mike Skaff / Pi Day lecture.

Gambling and Randomness

Abhijit Dasgupta

When and Where

Tuesday, March 10, 1:002:00pm

Room: E-239

Refreshments will be served at 12:30pm!

The Question : What is Randomness?

Professor Mike Skaff had a strong interest in gambling theory, and he wrote a book

on the subject. Gambling gave birth to probability theory, whose central concept is randomness. Randomness is notoriously hard to define precisely, but Richard Von

Mises in early 20th Century pioneered a definition based on gambling. Earlier work of Emile Borel had shown that in a limiting sense, random sequences are actually

highly well-behaved! Alonzo Church later brought in the idea of computer algorithms as a key ingredient of randomness. This gave birth to another field known as Algorithmic Randomness. The field grew dramatically through the work of

Martin-LΓΆf, Kolmogorov, Chaitin and others, who showed its surprising connections with Lebesgue measure theory, data compression, and mathematical logic. Algorithmic Randomness is a very active area of current research. This talk will be about the question What is Randomness?

skaff-talk-2015-flyer.pdf

MTH 2410- Feedback for Homework Due 02 18 2015

If z is a function of x,y, and x,y are functions of u,v, then z becomes a function of u,v.

Then computing the partial derivatives dz/du, dz/dv, the answer must not contain any x’s or y’s.

Section 13.5

Problems 44, 46, 49(a), 50(a),(b).

Section 13.6

Problems 2, 12, 16, 20, 36, 58, 64, 80, 88

Section 13.7

Problems 4, 10

Dear all,

I have to appear to the immigration office tomorrow.

Dr. Nart Shawash will cover the class.

He will do some examples with you on local min./local max. problems.

To compute the limit lim_{t->0} ln(t)/t use L’Hospital’s rule.

In general, use L’Hospital’s rule for limits of the form 0/0, or infinity/infinity.