# P4 - Math 141, Problem Set #4 (due in class Mon., 10/3/11)...

This preview shows pages 1–2. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Math 141, Problem Set #4 (due in class Mon., 10/3/11) Note: To get full credit for a non-routine problem, it is not enough to give the right answer; you must explain your reasoning. Stewart, section 1.5, problems 4, 12, 16, 18, 20, 28, 30, 32, 34, 36, 46, 47. • Clarification for problem 34: You must restrict yourself to functions f such that f ( x ) is defined for all x in [0 , 1]; no fair leaving f (0 . 25) undefined! • Clarification for problem 36: Since you’re trying to prove the existence of a positive number c such that c 2 = 2, it’s not legitimate to refer to √ 2 in your argument, since that assumes the existence of the very thing whose existence we’re trying to prove! • First hint for problem 47: Define u ( t ) to be the monk’s distance from the monastery t seconds after midnight on the first day, and define d ( t ) to be his distance from the monastery t seconds after midnight on the second day. Plot the functions u ( t ) and d ( t ) against the same coordinate axes. Saying that the monk is at the same point on his pathcoordinate axes....
View Full Document

## This note was uploaded on 02/13/2012 for the course MATH 141 taught by Professor Staff during the Fall '11 term at UMass Lowell.

### Page1 / 2

P4 - Math 141, Problem Set #4 (due in class Mon., 10/3/11)...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online