
A Parachutist in Free Fall
Figure 1.30 Skydivers can adjust [he velocity of their dive by changing the position of their body during the free fall. (credit: Jeremy T. Lock)
Julie is an avid skydiver. She has more than 30 jumps under her belt and has mastered the art of making adjustments
to her body position in the air to control how fast she falls. If she arches her back and points her belly toward the
ground, she reaches a terminal velocity of approximately 120 mph [176 ft/sec). If, instead, she orients her body with
her head straight down, she falls faster, leaching a terminal velocity of 150 mph (220 ft/sec).
Since Julie will be moving (falling) in a downward direction, we assume the downward direction is positive to simplify
our calculations. Julie executes her jumps from an altitude of 12,500 ft. After she exits the aircraft, she immediately
starts falling at a velocity given by v(t) = 32t. She continues to accelerate according to this velocity function until she
reaches terminal velocity. After she reaches terminal velocity, her speed remains constant until she pulls her ripcord
and slaws down In land.
On her first jump of the day, Julie orients herself in the slower "belly down” position (terminal velocity is 176 ft/sec).
Using this information, answer the following questions.
1. How long aim: she exits the aircraft does Julie reach terminal velocity?

Trending nowThis is a popular solution!

Chapter 1 Solutions
Calculus Volume 2
Additional Math Textbook Solutions
Calculus: Early Transcendentals (2nd Edition)
Calculus: Early Transcendentals (2nd Edition)
Elementary Statistics (13th Edition)
Thinking Mathematically (6th Edition)
A First Course in Probability (10th Edition)
- Find the first four nonzero terms in a power series expansion about x=0 for a general solution to the given differential equation w''-14x^2w'+w=0arrow_forwardLet X represent the full height of a certain species of tree. Assume that X has a normal probability distribution with mean 203.8 ft and standard deviation 43.8 ft. You intend to measure a random sample of n = 211trees. The bell curve below represents the distribution of these sample means. The scale on the horizontal axis (each tick mark) is one standard error of the sampling distribution. Complete the indicated boxes, correct to two decimal places. Image attached. I filled in the yellow boxes and am not sure why they are wrong. There are 3 yellow boxes filled in with values 206.82; 209.84; 212.86.arrow_forwardAnswer this questionarrow_forward
- 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}arrow_forwardA 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.arrow_forwardConsider 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).arrow_forward
- Consider a vocabulary consisting of the nucleotide bases V = {A, T, G, C}.Construct a DFA to recognize strings which end in AAGT .(a) Draw the DFA with clear markings of all states including start and acceptance state(s).(b) Simulate the DFA to show that string T GAAGT will be accepted by the DFA.(c) Simulate the DFA to show that string T AAGT G will not be accepted by the DFA.arrow_forwardA palindrome is a string that reads the same backward as it does forward. For example, abaaaba is a palindrome. Suppose that we need to define a language that generates palindromes.(a) Define a phase structure grammar that generates the set of all palindromes over the alphabet {a, b}clearly describing the recursive rules that generates palindromes. Use the notation Symbol → rule. Theempty set is denoted by λ. Clearly identify the terminal and non-terminal symbols in your grammar.(b) Show that the palindrome abaaaba can be recognized by your grammar. To show this, show all stepsof parsing the expression abaaaba using the rules you defined above.arrow_forwardA full k-ary tree is a (rooted) tree whose nodes either have exactly k children (internal nodes) or have no children (leaves). Using structural induction, formally prove that every full k-ary tree that has x internal nodes has exactly kx + 1 nodes in total. Note that for full binary trees, i.e., when k = 2, this would imply that the total number of nodes is 2x + 1.arrow_forward
- Elementary AlgebraAlgebraISBN:9780998625713Author:Lynn Marecek, MaryAnne Anthony-SmithPublisher:OpenStax - Rice UniversityGlencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw Hill
- Trigonometry (MindTap Course List)TrigonometryISBN:9781337278461Author:Ron LarsonPublisher:Cengage LearningAlgebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal LittellAlgebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage




