Explanation Formula used: Maclaurin expansion of sin x : “The Maclaurin expansion of sin x is given by, sin x = x − x 3 3 ! + x 5 5 ! − x 7 7 ! + ⋯ ” Calculation: First obtain the Maclaurin expansion of sin x 2 as follows. Replace x by x 2 in the Maclaurin expansion of sin x and obtain the Maclaurin expansion of sin x 2 as follows. sin x 2 = x 2 − ( x 2 ) 3 3 ! + ( x 2 ) 5 5 ! − ( x 2 ) 7 7 ! + ⋯ = x 2 − x 6 6 + x 10 120 − x 14 5040 + ⋯ Now obtain the value of the integral ∫ 0 1 sin x 2 d x as shown below

11th Edition

ISBN: 9780134437705

Author: Washington

Publisher: PEARSON

See similar textbooks

Videos

Question

Chapter 30.3, Problem 11E

To determine

To evaluate: The integral ∫01sinx2dx using the first three terms of the series of sinx2.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 30.3, Problem 10E

Chapter 30.3, Problem 12E

Students have asked these similar questions

In this exercise, we will investigate a technique to prove that a language is notregular. This tool is called the pumping lemma.The pumping lemma says that if M = (S, I, f, s0, F ) is a DFA with p states (i.e., p = |S|) and if the wordw is in L(M ) (the language generated by M ) and w has length greater than or equal to p, then w may bedivided into three pieces, w = xyz, satisfying the following conditions:1. For each i ∈ N, xy^i z ∈ L(M ).2. |y| > 0 (i.e., y contains at least one character).3. |xy| ≤ p (i.e., the string xy has at most p characters). Use the pumping lemma to show the following language is not regular (HINT: Use proof by contradictionto assume the language is regular and apply the pumping lemma to the language):L = {0^k1^k | k ∈ N}

A prefix of length ℓ of some word w are the first ℓ characters (in order) of w.1. Construct a context-free grammar for the language: L = {w ∈ {a, b}∗ | every prefix of w has at least as many a’s as b’s}2. Explain why every word generated by your context-free grammar (in Part 1) is contained in L. Then,prove via induction that every w ∈ L is produced by your context-free grammar.

Consider a simplified version of American football where on any possession ateam can earn 0, 3 or 7 points. What is the smallest number n0 of points such that for all n ≥ n0 and n ∈ Na team could earn n points. You must prove that your answer is correct via induction (HINT: Don’t forgetto show that n0 is the smallest number above which any number of points is reachable).

Chapter 30 Solutions

Basic Technical Mathematics

Ch. 30.1 - Prob. 1PE Ch. 30.1 - Prob. 2PE Ch. 30.1 - Prob. 1E Ch. 30.1 - Prob. 2E Ch. 30.1 - Prob. 3E Ch. 30.1 - Prob. 4E Ch. 30.1 - Prob. 5E Ch. 30.1 - Prob. 6E Ch. 30.1 - Prob. 7E Ch. 30.1 - Prob. 8E

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.

The integral ∫ 0 1 sin x 2 d x using the first three terms of the series of sin x 2 .

Videos

To evaluate: The integral ∫01sinx2dx using the first three terms of the series of sinx2.

Want to see the full answer?

Chapter 30 Solutions