2 Pages

hw6

Course: MATH 163, Fall 2008
School: Concordia Chicago
Rating:
 
 
 
 
 

Word Count: 366

Document Preview

6: Homework The Nature of Sin Denition 1 =2 1 1 x2 dx. 1 1. Geometrically motivate this denition (with picture(s)!). Denition 2 For 1 x 1, x 1 x2 + A(x) = 2 1 1 t2 dt. x 2. Geometrically motivate this denition. Hint: the rst term is the area of a triangle. 3. Calculate A (x) and A(1), A(1). Denition 3 The function cos : [0, ] R is dened by letting cos x be the unique number in [1, 1] such that A(cos...

Register Now

Unformatted Document Excerpt

Coursehero >> Illinois >> Concordia Chicago >> MATH 163

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
6: Homework The Nature of Sin Denition 1 =2 1 1 x2 dx. 1 1. Geometrically motivate this denition (with picture(s)!). Denition 2 For 1 x 1, x 1 x2 + A(x) = 2 1 1 t2 dt. x 2. Geometrically motivate this denition. Hint: the rst term is the area of a triangle. 3. Calculate A (x) and A(1), A(1). Denition 3 The function cos : [0, ] R is dened by letting cos x be the unique number in [1, 1] such that A(cos x) = x . The function sin : [0, ] R 2 is dened by: sin x = 1 (cos x)2 . 4. Prove that cos and sin are well dened by showing that A is a bijection from [1, 1] to [0, ]. 5. Consider a line in the x, y plane through the origin that makes an angle of with the positive x-axis, where 0 . Prove that the line intersects the unit circle (i.e. the circle centered at the origin with radius 1) at the point (cos , sin ). Denition cos, 4 sin : R R are dened as the unique functions agreeing with Denition 3 on [0, ] that satisfy: sin x = sin(x) cos x = cos(x) sin(x + 2 ) = sin x cos(x + 2 ) = cos x. 1 6. Prove that: sin x = cos x, 7. Dene f (x) = Prove that f is continuous at 0. Recall that a function f : R R is twice-dierentiable if f is dierentiable and f is dierentiable. Naturally, we write f for the derivative of f . 8. Suppose that f : R R is twice-dierentiable and satises: f +f =0 f (0) = 0 f (0) = 0. Prove that f ...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Concordia Chicago - MATH - 163
Homework 7: Polynomial ApproximationsThe goal here is to discuss polynomial approximations of dierentiable functions. Lets begin with a warm-up. Denition 1 A function s : [a, b] R is called a step function if there exists a partition a = t0 < . .
Concordia Chicago - MATH - 163
Concordia Chicago - MATH - 163
Concordia Chicago - MATH - 163
N.C. State - MA - 242
Cornell - PRH - 7090
Theor Soc DOI 10.1007/s11186-008-9065-1Polarization and convergence in academic controversiesSidney Tarrow# Springer Science + Business Media B.V. 2008Abstract Not many years ago both anthropology and political science experienced internal dis
Cornell - PRH - 7090
': '=:-:| t11;ai ,i:;,ri 1 = i,'.:z=,rt,:,:;,i-; : : :i= = , i!l=t:-=:;' 1 : t = : itz:= 1 . =l :'=i ; , - : : : =a = . :=rij laa =-=1, 1 '1 1, 1 : : ; : v: ; =1=:t;,=i=,=:, , - ,t,r=-t| , t;:;:i-:|: t; - =:' - t :ZZiZ:;:z'l'= i Z :i11:1
Cornell - PRH - 7090
THIS DRAFT IS TO APPEAR AS CHAP. 7 IN A VOLUME ON VENGEANCE, ED. PRH AND SUSANNA THROOP, TO BE PUBLISHED BY ASHGATE 2009 Was there Really Such a Thing as Feud in the High Middle Ages? 1 Paul R. Hyams Few of us, however hard we try, can avoid the urge
Cornell - PRH - 7090
Cornell - PRH - 7090
r rE.3 i lsH ir"*=iFIH[BEg. E T i; siiiilliiiliiiffiEl}EElii[lE +Eagiiria[tBiui*i 'Etl$[1lE $ -$ilr F iEI $ [ffi[g[til3F?[Ei}[ ksIiE[Fr -3 rIlllg+le IIigffi[iliililiglffiiIIialIE iEI}tB E E lll$ lIEilAliIa iIEliiiiF >n=o:F'*Fl*\ 6 irpi.R -
Cornell - PRH - 7090
I*; F EIIEig!+igffigEg ? :Il is t! ti" ; : g e* a gE Ett;f,; iitE;g?i ;* H x E ;t*Etirls E ;! F ;= r $ Ei.;{ t trsF lsEl!$iiiit3:ir; !E i i E ti:cSi EE E gEaEsT;E;tg:ipieN a ar!,*li:Etlgii*;iii iiE $ s! i$ ^ E i 5 (n aEsSgs>3\:S FEE SF
Wilfrid Laurier - OCT - 677
AbstractThis article defines community for educators and proceed to examine fundamental issues around new theories and practice for constructing learning communities. Our concept of community asks the reader not to consider the shape of institutions
Wilfrid Laurier - NOV - 677
Advance OrganizerPresenter: Andrea Fallscheer November 28, 2002 Goals of the Presentation:To introduce emerging technologies in distributed learning environments To discuss implications of investment in distributed learning and emerging technologie
Wilfrid Laurier - NOV - 677
MillionaireGoals of the PresentationTo introduce emerging technologies in distributed learning environments To discuss implications of investment in distributed learning and emerging technologies To discuss the role of distributed learning in the
Wilfrid Laurier - NOV - 677
Telecommunications in Education: Examining Distributed Teaching and Learning Environments(EDER 677 L.91)the future of online learning environmentsfor the Synchronous Class and for the Web Site on November 28 from Calgary E. Kowch 2002 1Housek
Wilfrid Laurier - OCT - 677
Advanced Organizer AdvancedFor EDER 677 Centra Presentation on October 17th, 2002 Group: Crystal Gaudry, Tammie-Lyne Aubin, Collene Armstrong, Steffen Tweedle Topic: The Future of Computer Mediated Communication Purpose: This Advanced Organizer is
Wilfrid Laurier - OCT - 677
Telecommunications in Education: Examining Distributed Teaching and Learning Environments(EDER 677 L.91 )ComputerMediatedCommunicationSystemsfor the Asynchronous Class from Calgary, October 3 E. Kowch 2002 1Housekeeping Items - Oct 03 Class -
Wilfrid Laurier - SEPT - 677
First Principles of InstructionSubmitted for publication to Educational Technology Research & Development M. David Merrill1 Utah State University Recent years have seen a proliferation of instructional design theories and models. Tennyson et al (199
Wilfrid Laurier - OCT - 677
EDER 677 Telecommunications in EducationDifferent Modes of Telecommunication Systems - Linking to Learn -Norm Vaughan1Goals of this Session Key Terms Linking Resources Linking Configurations Advantages of Linking to Learn Implementation I
Wilfrid Laurier - OCT - 677
EDER677 TelecommunicationsinEducationDifferentModesofTelecommunication Systems:distanceEducationImplicationsLinkingtoLearn Kowch,2003 E. Kowch 2002 1Goals of this Session Key Terms Linking Resources Linking Configurations Advantages of Li
Washington - CONJ - 480
_ _ _Functional Reflexes and Spinal Disorders_ _ _ ___The simple reflex is what all complex movements are based upon Reflexes are the foundation of nearly all movements Through modulation of the basic stretch reflex, and other reflexes, by
NJIT - ENG - 352
Departments Expansion Proposal ProposalYu Lam Tariq Moujtahid Javier Vasques John NicolaBackground Information BackgroundComputer Structural Engineering Inc. was founded in New York Computer City in 1995. City One of the leading companies in the
UCSB - GEOG - 191
AreasofQuantitativeMethodsOR/MS 1IntroductiontoOptimizationR.L.ChurchMathProgramming/optimization DecisionTheory GraphTheory GameTheory QueuingTheory StochasticProcesses Simulation21MathProgramming Linearprogramming Integerprogr
UCSB - GEOG - 191
An example problem.The Simplex AlgorithmR L Church Geography 191Max s.t.Z = 50 x1 + 40 x2 3 x1 8 x1 where + 5 x2 1x2 + 5 x2 x1 , x2 0 150 150 20 30012Anderson, Sweeney, & Williams, CD (Chapter 17)600Example optimization problem,
UCSB - GEOG - 191
Geog 191/291 Introduction to Optimization for Geographic ProblemsClassical Transportation ProblemConstruct an initial BF solution (e.g. Northwest Corner Rule) Intialization Optimality Test Derive Ui and Vj by selecting the row having the largest
UCSB - GEOG - 191
Geog 191/291 Introduction to Optimization for Geographic ProblemsInitialization MethodsThere are several methods for initializing a Classical Transportation Problem (CTP). In addition to the Northwest Corner Rule, there is Vogels Approximation Me
UCSB - GEOG - 191
Geog 191 Terminology: Linear programming problem Three components of an optimization problem canonical form slack variable surplus variable artificial variable simplex method role of reduced costs, ratio test, pivot operations eco
Ball State - MATH - 311
Tentative Schedule Math 311 Section 1 Spring Semester 2006As of January 10, 2006January Sunday 8 15 22 29 9 16 23 30 M.L.K. Day Monday Tuesday Wednesday 10 11 1.1 17 18 1.3 24 25 2.1 31 2.3 Thursday Friday 12 13 1.2 19 20 1.4 26 27 2.2 Saturday 14
Ball State - MATH - 311
Chapter 22.1 3. Which of the elements in Z4 = {[0], [1], [2], [3]} are squares of another element? Square each one to nd out. 13. Ignore the hint in the back of the text. Work with the formulas (a2 b2 ) = (a b)(a + b) and (a3 b3 ) = (a b)(a2 + a
Ball State - MATH - 311
Chapter 33.1 5. First check if the subset S is really a subring. The checklist for that is spelled out in Theorem 3.2. If S is a subring, try to nd an element 1S in S that acts as a multiplicative identity. 13. Multiplication and addition is underst
Ball State - MATH - 311
Chapter 4Remember: F will always stand for a eld. 4.1 11. Take f (x) = x F [x]. Could there be a polynomial g (x) F [x] such that f (x)g (x) = 1F ? Could f (x) be a unit? 17. Compare with Problem #19(c). 18. For D : R[x] R[x] to be a homomorphism
Ball State - MATH - 311
Chapter 77.1 4. (a) If you wonder where they come up with that stu: recall that f : Z10 Z5 Z2 given by f ([x]10 ) = ([x]5 , [x]2 ]) is an isomorphism of rings. Since f ([6]10 ) = ([1]5 , [0]2 ) generates the subring Z5 {0} of Z5 Z2 , then [6] ge
Stanford - TGX - 1007
US District Court Civil Docket as of 03/12/2004US District Court for the Northern District of Georgia(Atlanta) 1:99cv141 In Re: Theragenics Corp SEC Date Filed: 01/15/1999 Assigned To: Judge Thomas W Thrash Referred To: Nature of suit: Securities
N.C. State - LOGSYNTH - 090
@filesyn_binate_ref_10210_tab.txt @date2007-02-05-12-08-06(Mon Feb 05 12:08:06 UTC 2007) @BeginTabularInstanceDirInstanceFileSolutionStatusObjectiveBestNumOnesRunTimeNodes_visitedIterationsClique_cutsCover_cutsRunTimeIsInBoundSolutio
UNC - CS - 110
Comp 110for ( int i = 0; i < 3; i = i +1 ) { for ( int j = 0; j < 3; j = j + 1) { System.out.println(i * j); } }for ( int i = 0; i < 3; i = i +1 ) { for ( int j = 0; j < 3; j = j + 1) { System.out.println(i * j); } }Outer loopfor ( int i = 0;
N.C. State - ENGR - 517
Web services: SOAP, WSDL, UDDIA Web service is a software system that supports interoperable machine-to-machine interaction. Interaction means that more than one application is involved. Interoperable means that applications can operate with one a
Penn State - SCB - 223
Serge BallifMATH 527 Homework 1September 7, 2007Problem 1. Let X be a topological space, and A be its subset. Is it true that A , the set of limit points of A is always closed in X? It is not true in general. For a counterexample, we can take X
Penn State - SCB - 223
Serge BallifMATH 527 Homework 11November 28, 2007Problem 1. Calculate the homology groups of S 3 with two unlinked circles deleted.Call our space X and the two deleted circles A and B. We can view a space homoeomorphic to the one above, by se
Penn State - SCB - 223
Serge BallifMATH 527 Homework 12December 7, 2007Problem 1. Show that S n is not homeomorphic to any proper subspace of itself.Recall invariance of domain: Let U be open in n (or we could use S n ). Let f : U n be continuous and injective. Th
Penn State - SCB - 223
Serge BallifMATH 527 Homework 2September 14, 2007Problem 1. Consider a map h : R R , h(x1 , x2 , x3 , . . . ) = (x1 , 4x2 , 9x3 , . . . ). (a) Is h continuous, when R is given by the product topology? (b) Is h continuous, when R is given by th
Penn State - SCB - 223
Serge BallifMATH 527 Homework 3September 21, 2007Problem 1. Let X be a compact Hausdorff space. Let K1 K2 . . . be a sequence of closed connected subsets of X . Let K = 1 Ki . Show that K is connected. i=We note rst that X is normal since
Penn State - SCB - 223
Serge BallifMATH 527 Homework 4September 28, 2007Problem 1. Show that every locally compact Hausdorff space is completely regular.Let X be locally compact Hausdorff. Then X satisfies the conditions necessary for a one-point compactification.
Penn State - SCB - 223
Serge BallifMATH 527 Homework 5October 5, 2007Problem 1. Show that if A is a nonsingular 3 by 3 matrix having nonnegative entries, then A has a positive eigenvalue.Consider the closed positive octant P of the sphere S 2 . Since A has nonnegat
Penn State - SCB - 223
Serge BallifMATH 527 Homework 6October 12, 2007Problem 1. Does the Borsuk-Ulam theorem hold for the torus? In other words, for every map f : S 1 S 1 must there exist (x, y) S 1 S 1 , such that f (x, y) = f (-x, -y)?R2No. We can imbed th
Penn State - SCB - 223
Serge BallifProblem 1. Let K = {(x, y, z) group of X = 3 - K.MATH 527 Homework 7October 26, 2007RR3 | x2 + y2 = 1, z = 0}, the standard circle in R3. Compute the fundamentalX deformation rectracts onto a space X1 which is sphere centered
Penn State - SCB - 223
Serge BallifMATH 527 Homework 8November 2, 2007Problem 1. (a) Show that every continuous map f : P 2 S 1 is nulhomotopic. (b) Find a continuous map of the torus into S 1 that is not nulhomotopic.R(a) Suppose that f is homotopic to a nontri
Penn State - SCB - 223
Serge BallifMATH 27 Homework 9November 9, 2007Problem 1. Let p : E B be a covering map. Assume E is path connected and B is simply connected. Show that p is a homeomorphism.Since E is path connected, the lifting correspondence : 1 (B, b0 )
Penn State - SCB - 223
1 1.1Point-Set Topology Sucient ConditionsThe following are sucient conditions to guarantee each property. Normal. X is metrizable. X is compact Hausdor. X is regular and 2nd countable. X is regular and Lindelf. Regular. X is a subspace of a
Texas A&M - ELEN - 449
ELEN 449 Lab Syllabus (Tentative), Summer 2004TA: Sections: 301 302 303 Office: Office Hour: E-mail: Mail Box #: Phone: Nader Samaan W 2:00PM-04:50PM R 2:00PM-04:50PM R 11:00AM-02:00PM 30E ZACH M: 11:00AM 12:30PM W: 12:00PM - 1:30PM nsamaan@ee.tamu
Texas A&M - ELEN - 449
Lab # 3 ISA Prototyping and using the ABEL LanguageIntroduction In this lab, we introduce the ISA interface bus we will be using this semester. We also explore the Lattice MACH ispLEVER software to write, simulate, and debug an ABEL description of
Texas A&M - ELEN - 449
Lab # 4 Wire Wrapping and Programming the MACH 64/32Introduction In this lab, we introduce the skill (art?) of wire-wrapping as a means to prototype digital circuits. We begin by wire-wrapping the data transceiver block of the ISA interface prototy
Texas A&M - ELEN - 449
Lab # 5 - I/O Latch Interfacing and Timing ConsiderationsIntroduction In this lab, we learn to program the Lattice MACH 64/32 device with the JEDEC file we created in the last lab using the Lattice ispVMsystem tool. We learn how to use the Oscillosc
Texas A&M - ELEN - 449
Lab # 7 D/A Converter and Wait State GenerationIntroduction In this lab, we interface a DAC converter on our ISA prototype card. Care must be taken in the design process to insure the device will operate correctly. We will modify our CPLD to add a
Texas A&M - ELEN - 449
Lab # 8 A/D Converter and Interrupt ProcessingIntroduction In this lab, we interface an Analog-to-Digital Converter (ADC) to our ISA prototype card. We modify the ABEL source and program our CPLD to generate a conversion clock, chip select, and int
Texas A&M - ELEN - 449
LAB # 1 - Introduction to DOS, EDIT, and DEBUGPart I - Introduction to DOS Commands Introduction: In this part of the lab, we present several of the features supported by the disk operating system (DOS). The disk operating system is a program that c
Texas A&M - ELEN - 449
Lab # 1 Report Requirements (100 Points)Sign-off (20 Points) You must be signed-off by your TA before you leave the Lab. Students are required to Develop the required program for Part III, step 8 in the lab manual. Save your program as a .com file
Texas A&M - ELEN - 449
Lab # 2 Report Requirements (100 points)Sign-off (20 points) You must be signed-off by your TA before you leave the Lab. Students are required to Make demos for steps 9, 10, 11, 13; Correct the errors in Example 5 and make the demo for step 12, th
Texas A&M - ELEN - 449
Lab # 3 Report Requirements (150 points)Sign-off (50 points) You must be signed-off by your TA before you leave the Lab. Students are required to 1. Understand the ISA Interface Card-Block Diagram (figure 1) and the 8-Bit ISA Bus Cycle (figure 2) as
Texas A&M - ELEN - 449
Lab # 4 Sign-off and Report Requirements (150 points)Sign-off (50 points) You must be signed-off by your TA before you leave the Lab. Students are required to 1. Finish the required wire-wrapping. TA will check off your connections. (15 points) 2. F