×
Get Full Access to C++ For Everyone - 2 Edition - Chapter 5 - Problem P5.36
Get Full Access to C++ For Everyone - 2 Edition - Chapter 5 - Problem P5.36

×

# The drag force on a car is given byF v D ACD = 122 where is the density of air (1.23

ISBN: 9780470927137 356

## Solution for problem P5.36 Chapter 5

C++ for Everyone | 2nd Edition

• Textbook Solutions
• 2901 Step-by-step solutions solved by professors and subject experts
• Get 24/7 help from StudySoup virtual teaching assistants

C++ for Everyone | 2nd Edition

4 5 1 333 Reviews
28
5
Problem P5.36

The drag force on a car is given byF v D ACD = 122 where is the density of air (1.23 kgm3), v is the velocity in units of ms, A is theprojected area of the car (2.5 m2), and CD is the drag coefficient (0.2).The amount of power in watts required to overcome such drag force is P = FDv, andthe equivalent horsepower required is Hp = P 746. Write a program that accepts acars velocity and computes the power in watts and in horsepower needed to overcomethe resulting drag force. Note: 1 mph = 0.447 ms.

Step-by-Step Solution:
Step 1 of 3

Definition 1.1. Given two integers a and d with d non-zero, we say that d divides a (written d | a) if there is an integer c with a = cd. If no such integer exists, so d does not divide a, we write d - a. If d divides a, we say that d is a divisor of a. Proposition 1.2.1: Assume that a, b, and c are integers. If a | b and b | c, then a | c. Proposition 1.3. Assume that a, b, d, x, and y are integers. If d | a and d | b, then d | ax + by. Corollary 1.4. Assume that a, b, and d are integers. If d | a and d | b, then d | a + b and d | a − b. Proposition 1.4. Let a, b, c ∈ Z be integers. a) If a | b and b | c, then a | c. b) If a | b and b | a, then a = ±b. c) If a | b and a | c, then a | (b + c) and a | (b − c). Prime: A prime number is an integer p ≥ 2 whose only divisors are 1 and p. A composite number is an integer n ≥ 2 that is not prime. Ex: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29. The Division Algorithm: Let a and b be integers with b > 0. Then there exist unique integers q (the quotient) and r (the remainder) so that a = bq + r with 0 ≤ r < b. The greatest common devisor: Assume that a and b are integers and they are not both zero. Then the set of their common divisors has a largest element d, called the greatest common divisor of a and b. We write d = gcd (a, b). 12: 1, 2, 3, 4, 6, and 12. 18: 1, 2, 3, 6, 9, and 18. Then {1, 2, 3, 6} is the set of common divisors of 12 and 18. Gcd(12,18) = 6 Proposition 1.10: If a and b are integers with d = gcd(a, b), then a b gcd , =1

Step 2 of 3

Step 3 of 3

## Discover and learn what students are asking

Calculus: Early Transcendental Functions : Second-Order Homogeneous Linear Equations
?Finding a General Solution In Exercises 5-30,find the general solution of the linear differential equation. y’’ - y' = 0

Statistics: Informed Decisions Using Data : Scatter Diagrams and Correlation
?If r = _______, then a perfect negative linear relation exists between the two quantitative variables.

#### Related chapters

Unlock Textbook Solution